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 A069252 #19 Jul 18 2018 02:30:13 %S A069252 1,2,4,8,14,24,40,64,100,154,230,338,490,698,982,1366,1876,2550,3434, %T A069252 4578,6052,7938,10328,13342,17120,21820,27640,34810,43588,54290,67278, %U A069252 82958,101816,124404,151340,183350,221252,265958,318524,380132,452094 %N A069252 Number of basis partitions of n+81 with Durfee square size 9. %H A069252 Seiichi Manyama, <a href="/A069252/b069252.txt">Table of n, a(n) for n = 0..10000</a> %H A069252 M. D. Hirschhorn, <a href="https://doi.org/10.1016/S0012-365X(99)00030-8">Basis partitions and Rogers-Ramanujan partitions</a>, Discrete Math. 205 (1999), 241-243. %F A069252 G.f.: -(x +1) * (x^2 -x +1) * (x^4 -x^3 +x^2 -x +1) * (x^4 -x^2 +1) * (x^6 -x^5 +x^4 -x^3 +x^2 -x +1) * (x^6 -x^3 +1) * (x^8 +1) / ((x -1)^9 * (x^2 +x +1)^3 * (x^4 +x^3 +x^2 +x +1) * (x^6 +x^3 +1) * (x^6 +x^5 +x^4 +x^3 +x^2 +x +1)). - _Colin Barker_, Jul 13 2013 %o A069252 (PARI) s=9; a(n)=polcoeff(prod(i=1,s,(1+x^i))/(prod(i=1,s,(1-x^i))+x*O(x^n)),n) for(n=0,50,print1(a(n),",")) %Y A069252 Column k=9 of A316723. %K A069252 nonn,easy %O A069252 0,2 %A A069252 _Benoit Cloitre_, Apr 13 2002