OFFSET
1,2
COMMENTS
Partitions are counted with multiplicity and may overlap.
EXAMPLE
Only those partitions are counted that appear not later than prime A000230(n); n=7, d=14, A000230(7)=113; the number of solutions to p+14=q, with p and q both prime and p <= 113, is 11. These 11 (not necessarily distinct) partitions and their initial primes are as follows: 3[22424], 5[24242], 17[2462], 23[626], 29[2642], 47[662], 53[626], 59[2642], 83[68], 89[842], 113[14]=A000230(7).
PROG
(PARI) {for(n=1, 50, c=0; p=2; done=0; until(done, if(isprime(p+2*n), c++; if(nextprime(p+1)-p==2*n, done=1; print1(c, ", "))); p=nextprime(p+1)))} \\ Rick L. Shepherd
CROSSREFS
KEYWORD
nonn
AUTHOR
Labos Elemer, Jan 24 2003
EXTENSIONS
Corrected and extended by Rick L. Shepherd, Sep 08 2003
STATUS
approved