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 A352752 #6 May 13 2022 10:12:44
%S A352752 4031,1001,0,10,1000000000
%N A352752 a(n) is the smallest nonnegative number that requires n applications of the modified Sisyphus function of order 3, x -> A350709(x) to reach any number in the cycle {4031, 4112, 4220}.
%C A352752 The next term, a(5), is 1 0^100 1^9 2^10, a number with 120 digits, is too large to display.
%D A352752 M. E. Coppenbarger, Iterations of a modified Sisyphus function, Fib. Q., 56 (No. 2, 2018), 130-141.
%e A352752 0 -> 1100 -> 4220 reaches an element of the cycle {4031, 4112, 4220} in two iterates and must be the smallest, so a(2) = 0
%Y A352752 Cf. A350709.
%K A352752 nonn,base,more
%O A352752 0,1
%A A352752 _Matthew E. Coppenbarger_, Apr 01 2022