The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A274598 Number of ways to remove n oranges from an infinite stack of oranges whose m-th layer is an m X (m+4) rectangle. 6
 1, 5, 14, 40, 103, 247, 567, 1252, 2668, 5539, 11214, 22247, 43300, 82871, 156152, 290202, 532430, 965395, 1731351, 3073660, 5404984, 9420512, 16282463, 27922063, 47527430, 80331385, 134873275, 225015223, 373141724, 615224276, 1008792896, 1645443771, 2670372299, 4312780664, 6933014899 (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, A274599. Sequence in context: A027089 A184437 A023871 * A327682 A171185 A122485 Adjacent sequences: A274595 A274596 A274597 * A274599 A274600 A274601 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 December 5 23:11 EST 2023. Contains 367594 sequences. (Running on oeis4.)