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 A274598 #26 Aug 12 2019 02:45:02 %S A274598 1,5,14,40,103,247,567,1252,2668,5539,11214,22247,43300,82871,156152, %T A274598 290202,532430,965395,1731351,3073660,5404984,9420512,16282463, %U A274598 27922063,47527430,80331385,134873275,225015223,373141724,615224276,1008792896,1645443771,2670372299,4312780664,6933014899 %N 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. %C A274598 This problem was stated in this fashion by R. Kenyon and Ben Young in the Domino Forum (domino@listserv.uml.edu). %H A274598 Suresh Govindarajan, <a href="/A274598/b274598.txt">Table of n, a(n) for n = 0..45</a> %H A274598 Domino Forum, <a href="https://listserv.uml.edu/cgi-bin/wa.exe?A0=DOMINO">Domino Home Page</a> %H A274598 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. %Y A274598 Cf. A274582, A274594, A274596, A274597, A274599. %K A274598 nonn,hard %O A274598 0,2 %A A274598 _Suresh Govindarajan_, Jun 30 2016