login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A274597 Number of ways to remove n oranges from an infinite stack of oranges whose m-th layer is an m X (m+3) rectangle. 6
1, 4, 10, 28, 68, 158, 350, 750, 1559, 3170, 6292, 12252, 23445, 44164, 81995, 150288, 272150, 487388, 863887, 1516592, 2638648, 4552488, 7792566, 13239698, 22336630, 37433466, 62337628, 103186612, 169824540, 277967860, 452594316, 733229626, 1182159039, 1897140990, 3031012912 (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, A274598, A274599.

Sequence in context: A133726 A026534 A034920 * A203293 A111308 A121302

Adjacent sequences:  A274594 A274595 A274596 * A274598 A274599 A274600

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 18 09:39 EST 2020. Contains 332011 sequences. (Running on oeis4.)