The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 6
 1, 6, 19, 56, 152, 378, 898, 2042, 4476, 9526, 19740, 39978, 79342, 154650, 296489, 560022, 1043404, 1919708, 3491081, 6280514, 11185375, 19734004, 34509347, 59847208, 102976946, 175877782, 298279841, 502496682, 841161007, 1399559416, 2315201903, 3808746574, 6232651705, 10147431024 (list; graph; refs; listen; history; text; internal format)
 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 Domino Forum, Domino Home Page 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, A274596, A274597, A274598. Sequence in context: A272151 A272562 A176883 * A286184 A027044 A057571 Adjacent sequences: A274596 A274597 A274598 * A274600 A274601 A274602 KEYWORD nonn,hard AUTHOR Suresh Govindarajan, Jun 30 2016 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 13 03:35 EDT 2024. Contains 373366 sequences. (Running on oeis4.)