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”).

A309561
Total sum of prime parts in all compositions of n.
3
0, 0, 2, 7, 16, 44, 102, 244, 554, 1247, 2772, 6111, 13334, 28916, 62302, 133557, 285020, 605869, 1283362, 2710008, 5706546, 11986171, 25118500, 52529339, 109643310, 228455907, 475250388, 987177924, 2047710144, 4242128909, 8777675002, 18142184432, 37458037658
OFFSET
0,3
LINKS
FORMULA
G.f.: Sum_{k>=1} prime(k)*x^prime(k)*(1-x)^2/(1-2*x)^2.
a(n) ~ c * 2^n * n, where c = 0.27326606442562679135064648817419092073886899135... - Vaclav Kotesovec, Aug 18 2019
EXAMPLE
a(4) = 16: 1111, (2)11, 1(2)1, 11(2), (2)(2), (3)1, 1(3), 4.
MAPLE
a:= proc(n) option remember; add(a(n-j) +j*
`if`(isprime(j), ceil(2^(n-j-1)), 0), j=1..n)
end:
seq(a(n), n=0..33);
MATHEMATICA
a[n_] := a[n] = Sum[a[n-j]+j*If[PrimeQ[j], Ceiling[2^(n-j-1)], 0], {j, 1, n}];
a /@ Range[0, 33] (* Jean-François Alcover, Jan 03 2021, after Alois P. Heinz *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Aug 07 2019
STATUS
approved