The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 Table of n, a(n) for n=0..22. 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 Cf. A000045, A098080. Sequence in context: A097485 A098100 A105967 * A366487 A081510 A068844 Adjacent sequences: A097470 A097471 A097472 * A097474 A097475 A097476 KEYWORD easy,base,nonn AUTHOR Alexandre Wajnberg, Sep 18 2004 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 29 00:29 EDT 2024. Contains 372921 sequences. (Running on oeis4.)