login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A341987 Number of ways to write n as an ordered sum of 8 primes (counting 1 as a prime). 4
1, 8, 36, 112, 274, 560, 1016, 1688, 2647, 3928, 5580, 7568, 9990, 12832, 16332, 20336, 25167, 30472, 37004, 44136, 53054, 62272, 73788, 85240, 100276, 114752, 134072, 151144, 174834, 194616, 224304, 247240, 283467, 308448, 352668, 381032, 436368, 467272, 533520 (list; graph; refs; listen; history; text; internal format)
OFFSET
8,2
LINKS
FORMULA
G.f.: ( x + Sum_{k>=1} x^prime(k) )^8.
MATHEMATICA
nmax = 46; CoefficientList[Series[(x + Sum[x^Prime[k], {k, 1, nmax}])^8, {x, 0, nmax}], x] // Drop[#, 8] &
CROSSREFS
Sequence in context: A006636 A325656 A357716 * A341068 A092365 A014343
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Feb 24 2021
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 14 23:14 EDT 2024. Contains 375171 sequences. (Running on oeis4.)