The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A164067 Number of partitions of n into distinct Sophie Germain primes. 2
 0, 1, 1, 0, 2, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 2, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 2, 1, 1, 2, 1, 1, 3, 0, 2, 2, 0, 3, 1, 2, 2, 2, 2, 2, 2, 1, 2, 1, 1, 1, 2, 1, 2, 3, 1, 4, 2, 2, 3, 1, 2, 2, 2, 1, 3, 2, 2, 4, 2, 3, 3, 2, 2, 3, 1, 2, 3, 1, 3, 3, 2, 4, 3, 3, 4, 3, 3, 4, 3, 3, 4, 3, 5, 3, 5, 4, 4, 5, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 LINKS Andrew Howroyd, Table of n, a(n) for n = 1..1000 FORMULA G.f.: Product_{k>=1} (1 + x^A005384(k)). - Andrew Howroyd, Dec 28 2017 EXAMPLE e(16) = #{11+5, 11+3+2} = 2. PROG (PARI) ok(n)={isprime(n) && isprime(2*n+1)} {my(n=80); Vec(prod(k=1, n, 1 + if(ok(k), x^k + O(x*x^n), 0))-1, -n)} \\ Andrew Howroyd, Dec 28 2017 CROSSREFS Cf. A164066, A000586, A000009, A005384. Sequence in context: A065339 A122434 A141571 * A353918 A305490 A113706 Adjacent sequences: A164064 A164065 A164066 * A164068 A164069 A164070 KEYWORD nonn AUTHOR Reinhard Zumkeller, Aug 09 2009 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.

Last modified December 4 16:41 EST 2022. Contains 358563 sequences. (Running on oeis4.)