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 A364809 #23 Sep 14 2023 12:37:52
%S A364809 1,1,2,3,5,7,11,15,22,30,42,56,77,101,135,176,231,297,385,490,627,791,
%T A364809 1000,1250,1565,1938,2400,2945,3615,4395,5342,6439,7755,9268,11069,
%U A364809 13127,15537,18286,21484,25095,29275,33968,39344,45362,52193,59836,68441,78014,88724,100622,113828
%N A364809 Number of partitions of n with at most five part sizes.
%F A364809 a(n) = Sum_{k=1..5} A116608(n,k).
%o A364809 (Python)
%o A364809 from sympy.utilities.iterables import partitions
%o A364809 def A364809(n): return sum(1 for p in partitions(n) if len(p)<=5) # _Chai Wah Wu_, Sep 14 2023
%Y A364809 Cf. A265250, A309058, A364793.
%Y A364809 Cf. A116608, A365631.
%K A364809 nonn
%O A364809 0,3
%A A364809 _Seiichi Manyama_, Sep 14 2023