The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #25 Jul 10 2016 22:48:32
%S 1,2,5,12,29,64,139,286,582,1148,2227,4234,7950,14692,26842,48438,
%T 86509,152902,267783,464766,800095,1366512,2316840,3900502,6523432,
%U 10841282,17909533,29416966,48055443,78093926,126276743,203211038,325518314,519138982,824414851,1303853212,2053981256
%N Number of ways to remove n oranges from an infinite stack of oranges whose m-th layer is an m X (m+1) rectangle.
%C This problem was stated in this fashion by R. Kenyon and Ben Young in the Domino Forum (domino@listserv.uml.edu).
%H Suresh Govindarajan, <a href="/A274594/b274594.txt">Table of n, a(n) for n = 0..50</a>
%H S. Govindarajan, A. J. Guttmann and V. Subramanyan, <a href="https://arxiv.org/abs/1607.01890">On a square-ice analogue of plane partitions</a>, arXiv:1607.01890 [cond-mat.stat-mech], 2016.
%Y Cf. A274582, A274596, A274597, A274598, A274599.
%K nonn,hard
%O 0,2
%A _Suresh Govindarajan_, Jun 30 2016