Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #9 Jan 15 2018 07:16:03
%S 1,8,9,463,1057,4010,570097,32903,828667,25743541,431266313,
%T 16610986697,16089123031,1971622002613,2723872673,159888988030039,
%U 377543463271,12771918729143,19566551419628659,2983570575161357,1774565709813223
%N Maximal overhang that can be attained from a stack of blocks of lengths 1,2,...,n (numerators).
%C Data supplied by David Treeby.
%C For the classical problem when there are n blocks all of the same length see A001108/A002805 and A065071.
%D Treeby, David. "Further Thoughts on a Paradoxical Tower." The American Mathematical Monthly 125.1 (2018): 44-60.
%H David Treeby, <a href="/A298020/b298020.txt">Table of n, a(n) for n = 1..75</a>
%H David Treeby, <a href="/A298020/a298020.txt">Mathematica code</a>
%e 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 See link.
%Y For denominators see A298021.
%Y Cf. A001108/A002805, A065071.
%K nonn
%O 1,2
%A _N. J. A. Sloane_, Jan 15 2018