|
Search: id:A097485
|
|
|
| A097485 |
|
Write each natural integer on a single label. Put the labels in numerical order to form an infinite sequence L. Consider now the succession of single digits made by juxtaposing Fibonacci numbers: 0,1,1,2,3,5,8,1,3,2,1,3,4,5,5,8,9,1,4,4,2,3,3,3,7,7,6,1,0,9,8,7,1,5,9,7... (A031324). The sequence S gives a rearrangement of the labels that reproduces the same succession of digits, subject to the constraints that a label of L cannot represent itself (except the initial zero), and the smallest label must be used that does not lead to a contradiction. |
|
+0
2
|
|
| 0, 11, 23, 58, 1, 3, 2, 13, 4, 5, 589, 14, 42, 33, 37, 7, 6, 10, 9, 8, 71, 59, 72, 584, 41, 81, 67, 65, 109, 46, 17, 71, 12, 86, 57, 463, 68, 750, 25, 121, 39, 31, 96, 418, 317, 81, 151, 422, 98, 320
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Labels of L can be used only once in S. We could name this sequence the "Fibo_nat_cci" sequence (_nat_ stands for "natural numbers")
|
|
EXAMPLE
|
We must begin with 0,1,1,2,3,..., and we cannot represent the first "1" by the label "1", so the next possibility is the label "11". After "68" we must get "7,5,0,2,5,1,2,1,3,9,3,1,9,6,4,1,8..." (corresponding to Fibonacci numbers "75025,121393,196418..."), and we cannot use "75" since no label begins with a 0 (except the first one). So the next term is "750".
|
|
CROSSREFS
|
Adjacent sequences: A097482 A097483 A097484 this_sequence A097486 A097487 A097488
Sequence in context: A066179 A141093 A041236 this_sequence A098100 A105967 A097473
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Eric Angelini (eric.angelini(AT)kntv.be), Sep 19 2004
|
|
|
Search completed in 0.002 seconds
|
