login
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
OFFSET
1,5
LINKS
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
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Aug 09 2009
STATUS
approved