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.

A298603 Number of partitions of n into odd prime parts (including 1).

This page as a plain text file.
%I A298603 #5 Jan 22 2018 18:42:38
%S A298603 1,1,1,2,2,3,4,5,6,7,9,11,13,16,19,22,26,31,36,42,49,56,65,75,86,98,
%T A298603 112,127,144,164,185,209,235,264,297,332,372,416,463,516,574,638,708,
%U A298603 785,869,960,1061,1171,1291,1421,1563,1718,1886,2070,2269,2484,2718,2972,3247,3545,3868,4216,4592
%N A298603 Number of partitions of n into odd prime parts (including 1).
%C A298603 Partial sums of A099773.
%H A298603 <a href="/index/Par#part">Index entries for related partition-counting sequences</a>
%F A298603 G.f.: (1/(1 - x))*Product_{k>=2} 1/(1 - x^prime(k)).
%e A298603 a(6) = 4 because we have [5, 1], [3, 3], [3, 1, 1, 1] and [1, 1, 1, 1, 1, 1].
%t A298603 nmax = 62; CoefficientList[Series[1/(1 - x) Product[1/(1 - x^Prime[k]), {k, 2, nmax}], {x, 0, nmax}], x]
%Y A298603 Cf. A000607, A006005, A008578, A034891, A099773, A298604.
%K A298603 nonn
%O A298603 0,4
%A A298603 _Ilya Gutkovskiy_, Jan 22 2018