A298020 Maximal overhang that can be attained from a stack of blocks of lengths 1,2,...,n (numerators).

1, 8, 9, 463, 1057, 4010, 570097, 32903, 828667, 25743541, 431266313, 16610986697, 16089123031, 1971622002613, 2723872673, 159888988030039, 377543463271, 12771918729143, 19566551419628659, 2983570575161357, 1774565709813223

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