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 A308002 #9 May 12 2019 16:12:44 %S A308002 312,101,0,11,10000000000111111111 %N A308002 a(n) = smallest nonnegative number that requires n applications of the modified Sisyphus function x -> A171797(x) to reach 312. %C A308002 The next term, a(5), is 1 0^1000099 1^100010, a number with 1100110 digits, and is too large to display here. %C A308002 a(n) = index of first n in A100961. %D A308002 M. E. Coppenbarger, Iterations of a modified Sisyphus function, Fib. Q., 56 (No. 2, 2018), 130-141. %e A308002 0 -> 110 -> 312 reaches 312 in two steps, so a(2) = 0. %Y A308002 Cf. A100961, A171797. %K A308002 nonn,base %O A308002 0,1 %A A308002 _N. J. A. Sloane_, May 12 2019