A101565 a(n) = Sum_{k=0..n} (-1)^A010060(n-k)*[(n+1) mod (k+1) = 0], where [] denotes the Iverson bracket.

1, 0, 0, 1, 0, 2, 2, 0, 1, 2, 2, 2, 2, 0, 2, 1, 0, 4, 2, 2, 2, 0, 0, 2, 3, 0, 2, 0, 0, 4, 2, 0, 0, 2, 2, 5, 2, 0, 0, 2, 2, 0, 0, 2, 2, 2, 2, 2, 1, 2, 2, 2, 0, 6, 0, -2, 0, 2, 2, 4, 2, 0, 0, 1, 0, 2, 2, 2, 4, 2, 0, 6, 2, 0, 0, 2, 0, 4, 2, 2, 5, 0, 0, 2, 2, 2, 2, 2, 0, 4, 2, 0, 2, 0, 0, 2, 2, -2, 2, 5, 0

Offset

0,6

Links

Table of n, a(n) for n=0..100.

Prog

(PARI) tm(n) = hammingweight(n)%2;
a(n) = sum(k=0, n, if (((n+1) % (k+1))==0, (-1)^tm(n-k))); \\ Michel Marcus, Oct 01 2018

Crossrefs

Cf. A010060 (Thue-Morse sequence).

Sequence in context: A108483 A363623 A376630 * A377404 A292944 A327188

Adjacent sequences: A101562 A101563 A101564 * A101566 A101567 A101568

Keyword

easy,sign

Author

Paul Barry, Dec 07 2004

Status

approved