cp's OEIS Frontend

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.

A347588 Number of partitions of n into at most 6 distinct parts.

This page as a plain text file.
%I A347588 #4 Sep 08 2021 08:01:13
%S A347588 1,1,1,2,2,3,4,5,6,8,10,12,15,18,22,27,32,38,46,54,64,76,89,104,122,
%T A347588 142,165,192,221,255,294,337,385,441,501,570,646,731,824,930,1043,
%U A347588 1171,1310,1464,1630,1817,2015,2236,2473,2734,3013,3322,3648,4008,4391,4809,5252,5738,6249
%N A347588 Number of partitions of n into at most 6 distinct parts.
%H A347588 <a href="/index/Rec#order_21">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,0,0,-1,0,-2,0,1,1,1,1,0,-2,0,-1,0,0,1,1,-1).
%F A347588 G.f.: Sum_{k=0..6} x^(k*(k + 1)/2) / Product_{j=1..k} (1 - x^j).
%t A347588 nmax = 58; CoefficientList[Series[Sum[x^(k (k + 1)/2)/Product[(1 - x^j), {j, 1, k}], {k, 0, 6}], {x, 0, nmax}], x]
%t A347588 Join[{1}, LinearRecurrence[{1, 1, 0, 0, -1, 0, -2, 0, 1, 1, 1, 1, 0, -2, 0, -1, 0, 0, 1, 1, -1}, {1, 1, 2, 2, 3, 4, 5, 6, 8, 10, 12, 15, 18, 22, 27, 32, 38, 46, 54, 64, 76}, 58]]
%Y A347588 Cf. A001402, A014591, A065033, A347586, A347587.
%K A347588 nonn,easy
%O A347588 0,4
%A A347588 _Ilya Gutkovskiy_, Sep 08 2021