The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A298020 Maximal overhang that can be attained from a stack of blocks of lengths 1,2,...,n (numerators). 2
 1, 8, 9, 463, 1057, 4010, 570097, 32903, 828667, 25743541, 431266313, 16610986697, 16089123031, 1971622002613, 2723872673, 159888988030039, 377543463271, 12771918729143, 19566551419628659, 2983570575161357, 1774565709813223 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Data supplied by David Treeby. For the classical problem when there are n blocks all of the same length see A001108/A002805 and A065071. REFERENCES Treeby, David. "Further Thoughts on a Paradoxical Tower." The American Mathematical Monthly 125.1 (2018): 44-60. LINKS David Treeby, Table of n, a(n) for n = 1..75 David Treeby, Mathematica code EXAMPLE 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, ... MATHEMATICA See link. CROSSREFS For denominators see A298021. Cf. A001108/A002805, A065071. Sequence in context: A041605 A239524 A115073 * A042393 A264777 A114132 Adjacent sequences:  A298017 A298018 A298019 * A298021 A298022 A298023 KEYWORD nonn AUTHOR N. J. A. Sloane, Jan 15 2018 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 5 22:41 EDT 2021. Contains 346488 sequences. (Running on oeis4.)