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 A320380 #6 Oct 25 2018 05:34:06 %S A320380 10,0,11,11,23,23,48,48,87,100,164,192,290,344,500,614,847,1038,1412, %T A320380 1728,2286,2812,3650,4491,5758,7045,8924,10912,13668,16647,20691, %U A320380 25104,30952,37444,45853,55282,67291,80824,97860,117188,141132,168446,202003,240312 %N A320380 Number of parts in all partitions of n with largest multiplicity ten. %H A320380 Alois P. Heinz, <a href="/A320380/b320380.txt">Table of n, a(n) for n = 10..1000</a> %F A320380 a(n) ~ 3^(1/4) * log(11) * exp(2*Pi*sqrt(5*n/33)) / (2 * Pi * 55^(1/4) * n^(1/4)). - _Vaclav Kotesovec_, Oct 25 2018 %p A320380 b:= proc(n, i, k) option remember; `if`(n=0, [1, 0], `if`(i<1, 0, %p A320380 add((l->l+[0, l[1]*j])(b(n-i*j, i-1, k)), j=0..min(n/i, k)))) %p A320380 end: %p A320380 a:= n-> (k-> (b(n$2, k)-b(n$2, k-1))[2])(10): %p A320380 seq(a(n), n=10..50); %Y A320380 Column k=10 of A213177. %K A320380 nonn %O A320380 10,1 %A A320380 _Alois P. Heinz_, Oct 11 2018