The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A105967 Slowest increasing sequence all of whose successive digits are the digits of the Fibonacci numbers. 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; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Table of n, a(n) for n=0..21. 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. A093086, A102085, A098080. Sequence in context: A041236 A097485 A098100 * A097473 A366487 A081510 Adjacent sequences: A105964 A105965 A105966 * A105968 A105969 A105970 KEYWORD base,easy,nonn AUTHOR Alexandre Wajnberg, Apr 28 2005 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 June 25 11:48 EDT 2024. Contains 373701 sequences. (Running on oeis4.)