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!)
A212295 Number of ways to represent n as the sum of (zero or more) twin primes. 0

%I #4 Jun 27 2012 21:16:16

%S 1,0,0,1,0,1,1,1,1,1,2,2,3,3,3,4,4,7,6,8,9,8,14,12,18,18,19,26,24,36,

%T 35,42,49,49,68,67,86,93,100,127,126,167,172,200,235,240,313,316,389,

%U 429,464,573,584,732,778,888,1038,1089,1347,1412,1671,1873,2035,2449,2567,3093

%N Number of ways to represent n as the sum of (zero or more) twin primes.

%o (PARI) a(n,t=n)=if(n<3,!n,my(s=n%3==0); forprime(p=5,min(t,n), if(isprime(p+2), s+=a(n-p,p)+a(n-p-2,p+2))); s)

%Y Cf. A212294.

%K nonn

%O 0,11

%A _Charles R Greathouse IV_, Jun 27 2012

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 April 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)