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 A342446 #24 Apr 13 2021 10:53:29 %S A342446 1,4,1,9,2,1,21,3,1,1,44,4,1,1,1,90,6,2,1,1,1,182,9,2,1,1,1,1,367,13, %T A342446 3,1,1,1,1,1,736,19,3,1,1,1,1,1,1,1475,27,4,1,1,1,1,1,1,1,2952,38,5,2, %U A342446 1,1,1,1,1,1,1,5907,54,6,2,1,1,1,1,1,1,1,1 %N A342446 Square table read by antidiagonals downwards: T(n,k) = floor((4/(4^(1/2^n)-1))^(1/2^k)). %C A342446 Every positive integer occurs infinitely often. %H A342446 N. J. Fine and Marcin E. Kuczma, <a href="https://www.jstor.org/stable/2324192"> Writing Integers with Exactly Three Fours, Problem E 3363 [1990, 63]</a>, Amer. Math. Monthly, Vol. 99 (1992), No. 2, pp. 163-164. %F A342446 T(n,k) = floor((4/(4^(1/2^n)-1))^(1/2^k)). %e A342446 T(2,1) = floor((4/(4^(1/4)-1))^(1/2)) = floor(sqrt(4/(sqrt(2)-1))) = floor(3.1075...) = 3. %K A342446 nonn,tabl %O A342446 0,2 %A A342446 _Franz Vrabec_, Mar 12 2021