[go: up one dir, main page]

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!)
A369708 Maximal coefficient of (1 + x^3) * (1 + x^5) * (1 + x^7) * ... * (1 + x^prime(n)). 2
1, 1, 1, 1, 1, 1, 2, 2, 4, 5, 8, 14, 23, 40, 70, 126, 221, 394, 711, 1290, 2354, 4344, 8015, 14868, 27585, 51094, 95160, 178436, 335645, 634568, 1202236, 2261052, 4267640, 8067296, 15318171, 29031484, 55248527, 105251904, 200711160, 383580180, 733704990 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,7
LINKS
MAPLE
b:= proc(n) option remember; `if`(n<2, 1, expand(b(n-1)*(1+x^ithprime(n)))) end:
a:= n-> max(coeffs(b(n))):
seq(a(n), n=0..40); # Alois P. Heinz, Jan 29 2024
MATHEMATICA
Table[Max[CoefficientList[Product[(1 + x^Prime[k]), {k, 2, n}], x]], {n, 0, 40}]
PROG
(PARI) a(n) = vecmax(Vec(prod(i=2, n, 1+x^prime(i)))); \\ Michel Marcus, Jan 29 2024
(Python)
from collections import Counter
from sympy import prime
def A369708(n):
c = {0:1}
for i in range(2, n+1):
p, d = prime(i), Counter(c)
for k in c:
d[k+p] += c[k]
c = d
return max(c.values()) # Chai Wah Wu, Jan 31 2024
CROSSREFS
Sequence in context: A116085 A329692 A216198 * A085570 A059850 A308906
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Jan 29 2024
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 30 02:56 EDT 2024. Contains 375521 sequences. (Running on oeis4.)