A217670 G.f.: Sum_{n>=0} x^n/(1 + x^n)^n.

1, 1, 0, 2, -2, 2, 0, 2, -8, 8, 0, 2, -12, 2, 0, 32, -36, 2, 0, 2, -20, 58, 0, 2, -136, 72, 0, 92, -28, 2, 0, 2, -272, 134, 0, 422, -288, 2, 0, 184, -480, 2, 0, 2, -44, 1232, 0, 2, -2360, 926, 0, 308, -52, 2, 0, 2004, -1176, 382, 0, 2, -4064, 2, 0, 6470, -5128, 3642

Offset

0,4

Links

Seiichi Manyama, Table of n, a(n) for n = 0..10000 (terms 0..1000 from Paul D. Hanna)

Formula

a(4*n+2) = 0 for n>=0.

From Seiichi Manyama, Apr 23 2021: (Start)

a(n) = Sum_{d|n} (-1)^(d-1) * binomial(d+n/d-2, d-1) for n > 0.

If p is prime, a(p) = 1 + (-1)^(p-1). (End)

Example

G.f.: A(x) = 1 + x + 2*x^3 - 2*x^4 + 2*x^5 + 2*x^7 - 8*x^8 + 8*x^9 +...
where
A(x) = 1 + x/(1+x) + x^2/(1+x^2)^2 + x^3/(1+x^3)^3 + x^4/(1+x^4)^4 + x^5/(1+x^5)^5 +...

Mathematica

terms = 100; Sum[x^n/(1 + x^n)^n, {n, 0, terms}] + O[x]^terms // CoefficientList[#, x]& (* Jean-François Alcover, May 16 2017 *)

Prog

(PARI) {a(n)=polcoeff(sum(m=0, n, x^m/(1+x^m +x*O(x^n))^m), n)}
for(n=0, 100, print1(a(n), ", "))
(PARI) a(n) = if(n==0, 1, sumdiv(n, d, (-1)^(d-1)*binomial(d+n/d-2, d-1))); \\ Seiichi Manyama, Apr 23 2021

Crossrefs

Cf. A048272, A157019, A217668.

Sequence in context: A338434 A059288 A319109 * A243310 A197727 A176884

Adjacent sequences: A217667 A217668 A217669 * A217671 A217672 A217673

Keyword

sign

Author

Paul D. Hanna, Oct 10 2012

Status

approved