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 A298020 #15 Aug 08 2025 06:40:29 %S A298020 1,8,9,463,1057,4010,570097,32903,828667,25743541,431266313, %T A298020 16610986697,16089123031,1971622002613,2723872673,159888988030039, %U A298020 377543463271,12771918729143,19566551419628659,2983570575161357,1774565709813223 %N A298020 Maximal overhang that can be attained from a stack of blocks of lengths 1,2,...,n (numerators). %C A298020 Data supplied by David Treeby. %C A298020 For the classical problem when there are n blocks all of the same length see A001108/A002805 and A065071. %H A298020 David Treeby, <a href="/A298020/b298020.txt">Table of n, a(n) for n = 1..75</a> %H A298020 David Treeby, <a href="/A298020/a298020.txt">Mathematica code</a> %H A298020 David Treeby, <a href="https://www.jstor.org/stable/48661222">Further Thoughts on a Paradoxical Tower</a>, The American Mathematical Monthly 125.1 (2018): 44-60. %e A298020 The maximal overhangs are 1, 8/3, 9/2, 463/70, 1057/120, 4010/357, 570097/41496, 32903/2016, 828667/43605, 25743541/1180300, 431266313/17472840, 16610986697/601495180, ... %t A298020 (* See link. *) %Y A298020 For denominators see A298021. %Y A298020 Cf. A001108/A002805, A065071. %K A298020 nonn,frac %O A298020 1,2 %A A298020 _N. J. A. Sloane_, Jan 15 2018