

A097473


Slowest ever increasing sequence in which all successive digits are the digits of the Fibonacci sequence.


0



0, 11, 23, 58, 132, 134, 558, 914, 4233, 377610, 987159, 7258441, 81676510, 94617711, 286574636, 875025121, 3931964183, 17811514229, 83204013462, 692178309352, 4578570288792, 27465149303522, 41578173908816
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,2


COMMENTS

May be considered as two sequences hidden in each other: the digits of Fibonacci are hidden in this sequence; the digits of this sequence are hidden in the Fibonacci. Same comment for A098080 and the counting numbers.


LINKS



FORMULA

Write down the Fibonacci sequence 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 sequences of slices (disregarding the number of digits) of the succession of the digits of the Fibonacci sequence.


CROSSREFS



KEYWORD

easy,base,nonn


AUTHOR



STATUS

approved



