cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A105967 Slowest increasing sequence all of whose successive digits are the digits of the Fibonacci numbers.

Original entry on oeis.org

0, 11, 23, 58, 132, 134, 558, 914, 4233, 3776, 10987, 15972, 58441, 81676, 510946, 1771128, 6574636, 8750251, 21393196, 41831781, 151422983, 204013462
Offset: 0

Views

Author

Alexandre Wajnberg, Apr 28 2005

Keywords

Crossrefs

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.