A274599 - OEIS

A274599

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

%I #28 Aug 12 2019 02:45:18

%S 1,6,19,56,152,378,898,2042,4476,9526,19740,39978,79342,154650,296489,

%T 560022,1043404,1919708,3491081,6280514,11185375,19734004,34509347,

%U 59847208,102976946,175877782,298279841,502496682,841161007,1399559416,2315201903,3808746574,6232651705,10147431024

%N Number of ways to remove n oranges from an infinite stack of oranges whose m-th layer is an m X (m+5) 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="/A274599/b274599.txt">Table of n, a(n) for n = 0..45</a>

%H Domino Forum, <a href="https://listserv.uml.edu/cgi-bin/wa.exe?A0=DOMINO">Domino Home Page</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, A274594, A274596, A274597, A274598.

%K nonn,hard

%O 0,2

%A _Suresh Govindarajan_, Jun 30 2016