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 A123770 #14 Oct 08 2017 05:15:57 %S A123770 1,8,152,3594,96105,2734356,81126946,2480378897,77597683206, %T A123770 2472038270424 %N A123770 Number of ways, counted up to symmetry, to build a contiguous building with n LEGO blocks of size 1 X 3. %H A123770 S. Eilers, <a href="http://www.jstor.org/stable/10.4169/amer.math.monthly.123.5.415">The LEGO counting problem</a>, Amer. Math. Monthly, 123 (May 2016), 415-426. %H A123770 <a href="/wiki/Index_to_OEIS:_Section_Lc#LEGO">Index entry for sequences related to LEGO blocks</a> %Y A123770 Cf. A112389, A123762-A123827, A123829-A123849. %K A123770 nonn,hard,more %O A123770 1,2 %A A123770 _Søren Eilers_, Oct 29 2006