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!)
A369874 a(n) is the constant term in the expansion of Product_{d|n} (x^d + 1 + 1/x^d). 2
1, 1, 1, 1, 1, 5, 1, 1, 1, 1, 1, 23, 1, 1, 1, 1, 1, 13, 1, 13, 1, 1, 1, 103, 1, 1, 1, 7, 1, 77, 1, 1, 1, 1, 1, 175, 1, 1, 1, 63, 1, 49, 1, 1, 5, 1, 1, 463, 1, 1, 1, 1, 1, 41, 1, 39, 1, 1, 1, 2975, 1, 1, 3, 1, 1, 33, 1, 1, 1, 25, 1, 2363, 1, 1, 1, 1, 1, 25, 1, 261 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,6
COMMENTS
a(n) is the number of solutions to 0 = 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, 0], {n, 1, 80}]
PROG
(Python)
from collections import Counter
from sympy import divisors
def A369874(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[0] # Chai Wah Wu, Feb 05 2024
CROSSREFS
Sequence in context: A046602 A282304 A250662 * A340366 A031261 A188796
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 30 19:25 EDT 2024. Contains 373877 sequences. (Running on oeis4.)