|
Search: id:A105697
|
|
|
| A105697 |
|
A simple "Fractal Jump Sequence" (FJS). A FJS is a sequence of digits embedding an infinite amount of copies of itself. Modus operandi: underline the first digit "a" of such a sequence then jump over the next "a" digits and underline the digit "b" on which you land. Jump now from there over the next "b" digits and underline the digit "c" on which you land. Etc. The "abc...n..." succession of underlined digits is the sequence itself. |
|
+0
1
|
|
| 2, 2, 1, 2, 2, 2, 1, 2, 2, 1, 2, 2, 2, 1, 2, 2, 2, 1, 2, 2, 1, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 1, 2, 1, 2, 2, 2, 1, 2, 1, 2, 2, 2, 2, 2
(list; graph; listen)
|
|
|
OFFSET
|
2,1
|
|
|
COMMENT
|
This is how to construct the sequence: start with 2 on rows a and b; put 2 empty spaces behind the 2 on row a; choose any two digits and put them on row b under the 2 empty spaces of row a; go back to row a and add the same two digits but each one with its according spaces (1 must always be followed by 1 space on row a and 2 must always be followed by 2 spaces); go back to row b and add under the next available spaces of a the digits necessary so to have the same succession of digits in rows b and a. The sequence builds itself automatically. The row (c) is obtained by "pushing" (a) into (b) -- [the first digit of a and b melt in a single copy of themselves]. Row (c) is the FJS sequence above.
(a)..2..2..1.2..2..2..1.2..2..1.2..2..2..1.2
(b)..221.22.2.12.21.22.2.12.22.1.22.12.22.2.1
.....----------------------------------------
(c)..2212221221222122212212222112222122221221
|
|
EXAMPLE
|
To build such sequences one has only to choose the first digit d and the d digits to put under the d spaces of row (a).
|
|
CROSSREFS
|
Sequence in context: A134193 A085030 A078377 this_sequence A080757 A037196 A116543
Adjacent sequences: A105694 A105695 A105696 this_sequence A105698 A105699 A105700
|
|
KEYWORD
|
base,easy,nonn,uned
|
|
AUTHOR
|
Eric Angelini (eric.angelini(AT)kntv.be), May 04 2005
|
|
|
Search completed in 0.002 seconds
|
