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.

A099773 Number of partitions of n into odd prime parts.

This page as a plain text file.
%I A099773 #11 Jan 26 2018 20:00:20
%S A099773 1,0,0,1,0,1,1,1,1,1,2,2,2,3,3,3,4,5,5,6,7,7,9,10,11,12,14,15,17,20,
%T A099773 21,24,26,29,33,35,40,44,47,53,58,64,70,77,84,91,101,110,120,130,142,
%U A099773 155,168,184,199,215,234,254,275,298,323,348,376,407,439,474,511,551,592
%N A099773 Number of partitions of n into odd prime parts.
%H A099773 Alois P. Heinz, <a href="/A099773/b099773.txt">Table of n, a(n) for n = 0..5000</a>
%F A099773 G.f.: 1/Product_{k>1} (1-x^prime(k)).
%t A099773 CoefficientList[ Series[ Product[1/(1 - x^Prime[i]), {i, 2, 25}], {x, 0, 70}], x] (* _Robert G. Wilson v_, Jun 14 2006 *)
%o A099773 (Haskell)
%o A099773 a099773 = p a065091_list where
%o A099773    p _      0 = 1
%o A099773    p ks'@(k:ks) m = if m < k then 0 else p ks' (m - k) + p ks m
%o A099773 -- _Reinhard Zumkeller_, Aug 05 2012
%Y A099773 Cf. A000607, A024939.
%K A099773 easy,nonn
%O A099773 0,11
%A A099773 _Vladeta Jovovic_, Nov 11 2004