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 A002222 M4147 N1722 #26 May 24 2016 05:29:24 %S A002222 1,6,21,91,266,994,2562,7764,19482,51212,116028,288541,612463,1375609, %T A002222 2862437,6036606,11846488,24080685,45506290 %N A002222 a(n) is the number of partitions of 5n that can be obtained by adding together five (not necessarily distinct) partitions of n. %D A002222 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence). %D A002222 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %H A002222 N. Metropolis and P. R. Stein, <a href="http://dx.doi.org/10.1016/S0021-9800(70)80091-6">An elementary solution to a problem in restricted partitions</a>, J. Combin. Theory, 9 (1970), 365-376. %Y A002222 See A002219 for further details. Cf. A000041, A002220, A002221, A213074. %Y A002222 A column of A213086. %K A002222 nonn,more %O A002222 1,2 %A A002222 _N. J. A. Sloane_ %E A002222 Edited by _N. J. A. Sloane_, Jun 03 2012 %E A002222 a(12)-a(13) from _Alois P. Heinz_, Jul 10 2012 %E A002222 a(14)-a(19) from _Sean A. Irvine_, Sep 06 2013