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 A002603 M4971 N2134 #21 Oct 17 2023 08:19:05
%S A002603 1,15,73,143,208,244,265,273,282,490,838,1426,2367,3908,6356,10246,
%T A002603 16327,25812,40379,62748,96660,147833,224446,338584,507293,755612,
%U A002603 1118679,1647023,2411642,3513096,5091511,7344086,10543419,15068833,21442703,30385111,42880601
%N A002603 A generalized partition function.
%D A002603 Hansraj Gupta, A generalization of the partition function. Proc. Nat. Inst. Sci. India 17 (1951), 231-238.
%D A002603 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D A002603 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A002603 Alois P. Heinz, <a href="/A002603/b002603.txt">Table of n, a(n) for n = 1..1000</a>
%H A002603 Hansraj Gupta, <a href="/A002597/a002597.pdf">A generalization of the partition function</a>, Proc. Nat. Inst. Sci. India 17 (1951), 231-238. [Annotated scanned copy]
%p A002603 J:= m-> product((1-x^j)^(-j), j=1..m): a:= t-> coeff(series(J(min(9, t)), x, 1+max(9, t)), x, max(9, t)): seq(a(n), n=1..40); # _Alois P. Heinz_, Jul 20 2009
%t A002603 J[m_] := Product[(1-x^j)^-j, {j, 1, m}]; a[t_] := SeriesCoefficient[J[Min[9, t]], {x, 0, Max[9, t]}]; Table[ a[n], {n, 1, 40}] (* _Jean-François Alcover_, Mar 17 2014, after _Alois P. Heinz_ *)
%K A002603 nonn
%O A002603 1,2
%A A002603 _N. J. A. Sloane_
%E A002603 More terms from _Alois P. Heinz_, Jul 20 2009