This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A274582 #32 Jul 10 2016 22:47:49 %S A274582 1,1,4,10,24,51,109,222,452,890,1732,3298,6204,11470,20970,37842, %T A274582 67572,119368,208943,362389,623438,1064061,1802976,3033711,5071418, %U A274582 8424788,13913192,22847028,37315678,60631940,98030644,157743554,252671288,402944731,639871871,1011956958 %N A274582 Number of ways to remove n oranges from an infinite stack of oranges whose m-th layer is an m X m square. %C A274582 This problem was stated in this fashion by R. Kenyon in the Domino Forum (domino@listserv.uml.edu). %H A274582 Suresh Govindarajan, <a href="/A274582/b274582.txt">Table of n, a(n) for n = 0..60</a> %H A274582 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. %e A274582 a(1)=1 as only the orange in the top layer can be removed. a(2)=4 as there are four oranges in the second layer and any one of them can be removed. %Y A274582 Cf. A274594, A274596, A274597, A274598, A274599. %K A274582 nonn,hard %O A274582 0,3 %A A274582 _Suresh Govindarajan_, Jun 30 2016