|
|
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
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|