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.
%I A097473 #2 Mar 31 2012 14:11:36 %S A097473 0,11,23,58,132,134,558,914,4233,377610,987159,7258441,81676510, %T A097473 94617711,286574636,875025121,3931964183,17811514229,83204013462, %U A097473 692178309352,4578570288792,27465149303522,41578173908816 %N A097473 Slowest ever increasing sequence in which all successive digits are the digits of the Fibonacci sequence. %C A097473 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. %F A097473 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. %Y A097473 Cf. A000045, A098080. %K A097473 easy,base,nonn %O A097473 0,2 %A A097473 _Alexandre Wajnberg_, Sep 18 2004