|
Search: id:A105967
|
|
|
| A105967 |
|
Slowest increasing sequence all of whose successive digits are the digits of the Fibonacci numbers. |
|
+0
1
|
|
| 0, 11, 23, 58, 132, 134, 558, 914, 4233, 3776, 10987, 15972, 58441, 81676, 510946, 1771128, 6574636, 8750251, 21393196, 41831781, 151422983, 204013462
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
LINKS
|
Ron Knott, Fibonacci Numbers.
|
|
FORMULA
|
Write down the Fibonacci numbers and consider it as a unique succession of digits. Divide up into chunks of minimal length (and not beginning with 0) so that chunks are increasing numbers in order to form the slowest ever increasing sequence of slices (disregarding the number of digits) of the succession of the digits of the Fibonacci numbers.
|
|
CROSSREFS
|
Cf. A102761, A102085, A098080.
Sequence in context: A041236 A097485 A098100 this_sequence A097473 A081510 A068844
Adjacent sequences: A105964 A105965 A105966 this_sequence A105968 A105969 A105970
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Alexandre Wajnberg (alexandre.wajnberg(AT)ulb.ac.be), Apr 28 2005
|
|
|
Search completed in 0.002 seconds
|
