Regular paperfolding sequence
In mathematics the regular paperfolding sequence, also known as the dragon curve sequence, is an infinite automatic sequence of 0s and 1s defined as the limit of the following process: 11 1 01 1 0 1 1 0 01 1 0 1 1 0 0 1 1 1 0 0 1 0 0 Starting at n = 1, the first few terms of the regular paperfolding sequence are: 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, ... (sequence in the OEIS)
Wikipage disambiguates
Wikipage redirect
primaryTopic
Regular paperfolding sequence
In mathematics the regular paperfolding sequence, also known as the dragon curve sequence, is an infinite automatic sequence of 0s and 1s defined as the limit of the following process: 11 1 01 1 0 1 1 0 01 1 0 1 1 0 0 1 1 1 0 0 1 0 0 Starting at n = 1, the first few terms of the regular paperfolding sequence are: 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, ... (sequence in the OEIS)
has abstract
En mathématiques, et notamment ...... ... (c'est la suite de l'OEIS)
@fr
In mathematics the regular pap ...... 1, ... (sequence in the OEIS)
@en
Wikipage page ID
20,313,560
page length (characters) of wiki page
Wikipage revision ID
950,825,100
Link from a Wikipage to another Wikipage
align
right
@en
direction
horizontal
@en
footer
Dragon curves
@en
image
wikiPageUsesTemplate
hypernym
comment
En mathématiques, et notamment ...... ... (c'est la suite de l'OEIS)
@fr
In mathematics the regular pap ...... 1, ... (sequence in the OEIS)
@en
label
Regular paperfolding sequence
@en
Suite de pliage de papier
@fr