[go: up one dir, main page]

login
Revision History for A341988 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
Number of ways to write n as an ordered sum of 9 primes (counting 1 as a prime).
(history; published version)
#5 by Susanna Cuyler at Thu Feb 25 08:32:56 EST 2021
STATUS

proposed

approved

#4 by Ilya Gutkovskiy at Wed Feb 24 22:54:03 EST 2021
STATUS

editing

proposed

#3 by Ilya Gutkovskiy at Wed Feb 24 22:39:20 EST 2021
#2 by Ilya Gutkovskiy at Wed Feb 24 22:33:03 EST 2021
NAME

allocated for Ilya GutkovskiyNumber of ways to write n as an ordered sum of 9 primes (counting 1 as a prime).

DATA

1, 9, 45, 156, 423, 954, 1887, 3384, 5661, 8935, 13446, 19332, 26838, 36126, 47691, 61668, 78696, 98631, 122665, 150516, 184230, 222438, 268146, 318564, 379383, 445572, 525942, 610344, 712872, 817290, 947166, 1075680, 1238148, 1391475, 1591236, 1773684, 2022241

OFFSET

9,2

FORMULA

G.f.: ( x + Sum_{k>=1} x^prime(k) )^9.

MATHEMATICA

nmax = 45; CoefficientList[Series[(x + Sum[x^Prime[k], {k, 1, nmax}])^9, {x, 0, nmax}], x] // Drop[#, 9] &

KEYWORD

allocated

nonn

AUTHOR

Ilya Gutkovskiy, Feb 24 2021

STATUS

approved

editing

#1 by Ilya Gutkovskiy at Wed Feb 24 22:33:03 EST 2021
NAME

allocated for Ilya Gutkovskiy

KEYWORD

allocated

STATUS

approved