A274594 Number of ways to remove n oranges from an infinite stack of oranges whose m-th layer is an m X (m+1) rectangle.

1, 2, 5, 12, 29, 64, 139, 286, 582, 1148, 2227, 4234, 7950, 14692, 26842, 48438, 86509, 152902, 267783, 464766, 800095, 1366512, 2316840, 3900502, 6523432, 10841282, 17909533, 29416966, 48055443, 78093926, 126276743, 203211038, 325518314, 519138982, 824414851, 1303853212, 2053981256

Offset

0,2

Comments

This problem was stated in this fashion by R. Kenyon and Ben Young in the Domino Forum (domino@listserv.uml.edu).

Links

Suresh Govindarajan, Table of n, a(n) for n = 0..50

S. Govindarajan, A. J. Guttmann and V. Subramanyan, On a square-ice analogue of plane partitions, arXiv:1607.01890 [cond-mat.stat-mech], 2016.

Crossrefs

Cf. A274582, A274596, A274597, A274598, A274599.

Sequence in context: A321253 A290073 A232534 * A062422 A320553 A266465

Adjacent sequences: A274591 A274592 A274593 * A274595 A274596 A274597

Keyword

nonn,hard

Author

Suresh Govindarajan, Jun 30 2016

Status

approved