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 A320596 #4 Oct 16 2018 16:49:55 %S A320596 1,1,3,5,9,13,21,29,43,59,82,108,146,187,244,309,393,488,610,746,917, %T A320596 1109,1343,1606,1924,2277,2698,3168,3719,4331,5045,5833,6744,7750, %U A320596 8900,10167,11609,13189,14976,16934,19132,21533,24219,27143,30399,33939,37859 %N A320596 Number of partitions of n with eight parts in which no part occurs more than twice. %H A320596 Alois P. Heinz, <a href="/A320596/b320596.txt">Table of n, a(n) for n = 20..10000</a> %F A320596 G.f.: (x^15-x^11-x^10-x^8-x^7+x^4+x^3+x^2+1)*x^20 / ((x^2-x+1) *(x^4+x^3+x^2+x+1) *(x^4+1) *(x^6+x^5+x^4+x^3+x^2+x+1) *(x^2+1)^2 *(x^2+x+1)^2 *(x+1)^4 *(x-1)^8). %Y A320596 Column k=8 of A209318. %K A320596 nonn,easy %O A320596 20,3 %A A320596 _Alois P. Heinz_, Oct 16 2018