The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A069259 Limit of A069258(k,n) = number of partitions of 2*k into k-n prime parts, as k tends to infinity. 2

%I

%S 1,1,2,4,5,8,12,16,22,31,41,53,70,90,113,147,184,226,286,352,429,530,

%T 644,776,943,1135,1352,1623,1934,2283,2716,3207,3759,4431,5191,6050,

%U 7074,8236,9543,11079,12829,14786,17066,19659,22547,25895,29683,33897

%N Limit of A069258(k,n) = number of partitions of 2*k into k-n prime parts, as k tends to infinity.

%C a(n) is the number of ways to express 2*n as a sum of parts x such that x+2 is an odd prime. - _David Wasserman_, Apr 03 2003

%F G.f.: (A(sqrt(x))+A(-sqrt(x)))/2, where A(x) = 1/Product_{k>1} (1-x^(prime(k)-2)). - _Vladeta Jovovic_, Nov 12 2004

%Y Cf. A069258.

%K easy,nonn

%O 0,3

%A _Vladeta Jovovic_, Mar 10 2002

%E More terms from _David Wasserman_, Apr 03 2003

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

Last modified June 16 19:49 EDT 2021. Contains 345068 sequences. (Running on oeis4.)