cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

1, 1, 2, 4, 5, 8, 12, 16, 22, 31, 41, 53, 70, 90, 113, 147, 184, 226, 286, 352, 429, 530, 644, 776, 943, 1135, 1352, 1623, 1934, 2283, 2716, 3207, 3759, 4431, 5191, 6050, 7074, 8236, 9543, 11079, 12829, 14786, 17066, 19659, 22547, 25895, 29683, 33897
Offset: 0

Views

Author

Vladeta Jovovic, Mar 10 2002

Keywords

Comments

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

Crossrefs

Cf. A069258.

Formula

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

Extensions

More terms from David Wasserman, Apr 03 2003