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 A274596 #27 Jul 10 2016 22:48:59 %S A274596 1,3,7,19,44,98,213,448,918,1832,3584,6882,13012,24220,44480,80678, %T A274596 144697,256775,451305,786008,1357414,2325540,3954366,6676369,11196599, %U A274596 18657454,30901434,50884452,83327163,135733071,219978688,354780782,569519349,910130189,1448166991,2294680459 %N A274596 Number of ways to remove n oranges from an infinite stack of oranges whose m-th layer is an m X (m+2) rectangle. %C A274596 This problem was stated in this fashion by R. Kenyon and Ben Young in the Domino Forum (domino@listserv.uml.edu). %H A274596 Suresh Govindarajan, <a href="/A274596/b274596.txt">Table of n, a(n) for n = 0..45</a> %H A274596 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 A274596 Cf. A274582, A274594, A274597, A274598, A274599. %K A274596 nonn,hard %O A274596 0,2 %A A274596 _Suresh Govindarajan_, Jun 30 2016