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 A085693 #18 Dec 14 2022 16:25:55 %S A085693 0,1,1,2,1,2,2,2,3,1,2,2,2,3,2,2,3,2,2,3,3,3,3,4,1,2,2,2,3,2,2,3,2,2, %T A085693 3,3,3,3,4,2,2,3,2,2,3,3,3,3,4,2,2,3,2,2,3,3,3,3,4,3,3,3,4,3,3,3,4,3, %U A085693 3,3,4,4,4,4,4,5,1,2,2,2,3,2,2,3,2,2,3,3,3,3 %N A085693 Let f(0) = 1, f(1) = 12, f(2) = 223, f(3) = 3334, = f(4) = 44445, f(5) = 555556, etc. Sequence gives concatenation of 0, f(0), f(f(0)), f(f(f(0))), ... %e A085693 0; %e A085693 1; %e A085693 1, 2; %e A085693 1, 2, 2, 2, 3; %e A085693 1, 2, 2, 2, 3, 2, 2, 3, 2, 2, 3, 3, 3, 3, 4; ... %e A085693 For large m, the m-th block is given by A085694. %Y A085693 Cf. A085694, A000110, A048993 (the number of occurrences of k in n-th block). %Y A085693 Row maxima of A120698. %K A085693 nonn,base,easy %O A085693 0,4 %A A085693 _Philippe Deléham_, Aug 14 2003; revised Sep 18 2005 %E A085693 Edited by _Charles R Greathouse IV_, Apr 30 2010