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 A092322 #16 Jul 07 2019 03:03:02
%S A092322 1,1,4,4,9,12,19,24,36,48,64,83,108,140,179,224,280,352,432,532,652,
%T A092322 795,960,1160,1392,1669,1992,2368,2804,3320,3908,4592,5388,6300,7349,
%U A092322 8560,9940,11524,13340,15401,17752,20436,23472,26920,30840,35256,40252,45900
%N A092322 Sum of largest parts of all partitions of n into odd parts.
%C A092322 a(n) = Sum_{k>=1} k*A116799(n,k). - _Emeric Deutsch_, Feb 24 2006
%H A092322 Vaclav Kotesovec, <a href="/A092322/b092322.txt">Table of n, a(n) for n = 1..2500</a>
%F A092322 G.f.: Sum_{n>=1} (2*n-1)*x^(2*n-1)/Product_{k=1..n} (1-x^(2*k-1)).
%e A092322 a(5)=9 because the partitions of 5 into odd parts are [5],[3,1,1] and [1,1,1,1,1] and the largest parts add up to 5+3+1=9.
%p A092322 g:=sum((2*n-1)*x^(2*n-1)/Product(1-x^(2*k-1),k=1..n),n=1..30): gser:=series(g,x=0,50): seq(coeff(gser,x^n),n=1..48); # _Emeric Deutsch_, Feb 24 2006
%t A092322 nmax = 50; Rest[CoefficientList[Series[Sum[(2*n - 1)*x^(2*n - 1) / Product[(1 - x^(2*k - 1)), {k, 1, n}], {n, 1, nmax}], {x, 0, nmax}], x]] (* _Vaclav Kotesovec_, Jul 06 2019 *)
%Y A092322 Cf. A092314, A092269, A092309, A092321, A092313, A092310, A092311, A092268.
%Y A092322 Cf. A116799.
%K A092322 easy,nonn
%O A092322 1,3
%A A092322 _Vladeta Jovovic_, Feb 15 2004
%E A092322 More terms from Pab Ter (pabrlos(AT)yahoo.com), May 25 2004