The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A112022 Number of partitions of n into distinct Chen primes. 5
1, 0, 1, 1, 0, 2, 0, 2, 1, 1, 2, 1, 2, 2, 2, 2, 3, 2, 4, 3, 4, 4, 4, 5, 5, 5, 6, 5, 6, 7, 6, 9, 7, 9, 9, 9, 11, 11, 11, 13, 12, 14, 15, 14, 17, 15, 17, 19, 18, 21, 21, 21, 24, 24, 26, 28, 27, 30, 30, 32, 35, 34, 37, 37, 39, 41, 43, 45, 46, 48, 51, 53, 56, 58, 59, 61, 64, 66, 70, 71, 73 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,6
COMMENTS
a(n) = A000586(n) for n <= 42.
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 0..10000
FORMULA
G.f.: Product_{k>=1} (1 + x^A109611(k)). - Andrew Howroyd, Dec 28 2017
MATHEMATICA
terms = 81;
gf = Times @@ (1 + x^SequencePosition[ PrimeOmega[ Range[terms]], {1, _, 1|2}][[All, 1]]) + O[x]^terms;
CoefficientList[gf, x] (* Jean-François Alcover, Jul 02 2018 *)
PROG
(PARI) P=1+O(x^1001); forprime(p=2, 1e3, if(bigomega(p+2)<3, P*=1+x^p)); Vec(P) \\ Charles R Greathouse IV, May 13 2013
CROSSREFS
Sequence in context: A223893 A358009 A358010 * A358011 A000586 A029399
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Aug 26 2005
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 3 05:44 EDT 2024. Contains 373054 sequences. (Running on oeis4.)