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 A320597 #6 Nov 10 2022 14:55:44
%S A320597 1,2,3,6,10,15,24,35,50,71,98,131,178,234,304,393,503,633,798,992,
%T A320597 1225,1506,1839,2226,2692,3229,3856,4587,5434,6400,7526,8804,10266,
%U A320597 11934,13830,15964,18397,21123,24192,27640,31505,35805,40629,45978,51928,58531,65849
%N A320597 Number of partitions of n with nine parts in which no part occurs more than twice.
%H A320597 Alois P. Heinz, <a href="/A320597/b320597.txt">Table of n, a(n) for n = 25..10000</a>
%F A320597 G.f.: (x^20-x^19-x^18-x^16+x^14+2*x^11+x^10+x^9+x^8-x^6-x^4-x^3-x-1)*x^25 / ((x^2-x+1) *(x^4+x^3+x^2+x+1) *(x^6+x^3+1) *(x^4+1) *(x^6+x^5+x^4+x^3+x^2+x+1) *(x^2+1)^2 *(x^2+x+1)^3 *(x+1)^4 *(x-1)^9).
%t A320597 Table[Count[IntegerPartitions[n,{9}],_?(Max[Length/@Split[#]]<3&)],{n,25,75}] (* _Harvey P. Dale_, Nov 10 2022 *)
%Y A320597 Column k=9 of A209318.
%K A320597 nonn,easy
%O A320597 25,2
%A A320597 _Alois P. Heinz_, Oct 16 2018