%I #4 Jul 07 2016 23:54:49
%S 0,11,23,58,132,134,558,914,4233,3776,10987,15972,58441,81676,510946,
%T 1771128,6574636,8750251,21393196,41831781,151422983,204013462
%N Slowest increasing sequence all of whose successive digits are the digits of the Fibonacci numbers.
%H Ron Knott, <a href="http://www.maths.surrey.ac.uk/hosted-sites/R.Knott/Fibonacci/fib.html">Fibonacci Numbers</a>.
%F 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.
%Y Cf. A093086, A102085, A098080.
%K base,easy,nonn
%O 0,2
%A _Alexandre Wajnberg_, Apr 28 2005