login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A280245
Expansion of Product_{k>=1} (1 + x^prime(k))^2.
4
1, 0, 2, 2, 1, 6, 1, 8, 6, 6, 14, 6, 18, 14, 18, 24, 23, 30, 35, 38, 46, 54, 55, 74, 72, 90, 100, 106, 128, 136, 152, 178, 185, 216, 238, 252, 302, 308, 359, 390, 420, 478, 512, 564, 628, 668, 745, 810, 871, 974, 1035, 1140, 1238, 1336, 1459, 1586, 1700, 1868, 1993, 2168, 2354, 2512, 2751, 2930, 3177, 3418, 3677, 3960
OFFSET
0,3
COMMENTS
Number of partitions of n into distinct prime parts, with 2 types of each part.
Self-convolution of A000586. - Ilya Gutkovskiy, Jan 19 2018
LINKS
Vaclav Kotesovec, Table of n, a(n) for n = 0..10000 (terms 0..1000 from Seiichi Manyama)
Eric Weisstein's World of Mathematics, Prime Partition
FORMULA
G.f.: Product_{k>=1} (1 + x^prime(k))^2.
log(a(n)) ~ 2*Pi*sqrt(n/(3*log(n/2))). - Vaclav Kotesovec, Jan 12 2021
EXAMPLE
a(5) = 6 because we have [5], [5'], [3, 2], [3', 2], [3, 2'], [3', 2'].
MATHEMATICA
nmax = 67; CoefficientList[Series[Product[(1 + x^Prime[k])^2, {k, 1, nmax}], {x, 0, nmax}], x]
CROSSREFS
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Dec 29 2016
STATUS
approved