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 A365631 #22 Sep 16 2023 17:03:43
%S A365631 1,2,5,10,20,36,58,95,147,222,323,462,636,889,1184,1584,2060,2686,
%T A365631 3403,4353,5433,6768,8319,10230,12363,15011,17943,21467,25403,30044,
%U A365631 35231,41294,48002,55718,64328,74086,84880,97071,110607,125692,142313,160728,181112,203438,228124
%N A365631 Number of partitions of n with exactly five part sizes.
%H A365631 Alois P. Heinz, <a href="/A365631/b365631.txt">Table of n, a(n) for n = 15..5000</a>
%F A365631 G.f.: Sum_{0<i<j<k<l<m} x^(i+j+k+l+m)/( (1-x^i)*(1-x^j)*(1-x^k)*(1-x^l)*(1-x^m) ).
%e A365631 a(16) = 2 because we have 6+4+3+2+1, 5+4+3+2+1+1.
%p A365631 # Using function P from A365676:
%p A365631 A365631 := n -> P(n, 5, n): seq(A365631(n), n = 15..59); # _Peter Luschny_, Sep 15 2023
%o A365631 (Python)
%o A365631 from sympy.utilities.iterables import partitions
%o A365631 def A365631(n): return sum(1 for p in partitions(n) if len(p)==5) # _Chai Wah Wu_, Sep 14 2023
%Y A365631 A diagonal of A060177.
%Y A365631 Column k=5 of A116608.
%Y A365631 Cf. A000005, A002133, A002134, A365630.
%Y A365631 Cf. A364809.
%K A365631 nonn
%O A365631 15,2
%A A365631 _Seiichi Manyama_, Sep 13 2023