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

1, 3, 7, 19, 44, 98, 213, 448, 918, 1832, 3584, 6882, 13012, 24220, 44480, 80678, 144697, 256775, 451305, 786008, 1357414, 2325540, 3954366, 6676369, 11196599, 18657454, 30901434, 50884452, 83327163, 135733071, 219978688, 354780782, 569519349, 910130189, 1448166991, 2294680459

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..45

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, A274594, A274597, A274598, A274599.

Sequence in context: A146685 A146653 A096447 * A374728 A348008 A185696

Adjacent sequences: A274593 A274594 A274595 * A274597 A274598 A274599

Keyword

nonn,hard

Author

Suresh Govindarajan, Jun 30 2016

Status

approved