The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A369875 a(n) = [x^n] Product_{d|n} (x^d + 1 + 1/x^d). 1
1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 19, 1, 1, 1, 1, 1, 11, 1, 11, 1, 1, 1, 85, 1, 1, 1, 6, 1, 64, 1, 1, 1, 1, 1, 145, 1, 1, 1, 54, 1, 41, 1, 1, 5, 1, 1, 382, 1, 1, 1, 1, 1, 34, 1, 34, 1, 1, 1, 2425, 1, 1, 3, 1, 1, 27, 1, 1, 1, 23, 1, 1943, 1, 1, 1, 1, 1, 20, 1, 225 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,6
COMMENTS
a(n) is the number of solutions to n = Sum_{d|n} c_i * d with c_i in {-1,0,1}, i=1..tau(n), tau = A000005.
LINKS
MATHEMATICA
Table[Coefficient[Product[(x^d + 1 + 1/x^d), {d, Divisors[n]}], x, n], {n, 1, 80}]
PROG
(Python)
from collections import Counter
from sympy import divisors
def A369875(n):
c = {0:1}
for d in divisors(n, generator=True):
b = Counter(c)
for j in c:
a = c[j]
b[j+d] += a
b[j-d] += a
c = b
return c[n] # Chai Wah Wu, Feb 05 2024
CROSSREFS
Sequence in context: A293768 A046564 A046592 * A334432 A370130 A010326
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Feb 03 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 June 8 05:45 EDT 2024. Contains 373207 sequences. (Running on oeis4.)