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

1, 9, 99, 991, 9999, 100091, 1000001, 9999009, 100000099, 1000009991, 10000000001, 100000099109, 1000000000001, 9999999000009, 100000000010099, 999999990000991, 9999999999999999, 100000000100100091

Offset

0,2

Links

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

Prog

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

Crossrefs

Cf. A010060, A101563, A051731.

Sequence in context: A250603 A221579 A320075 * A242811 A070843 A261512

Adjacent sequences: A101561 A101562 A101563 * A101565 A101566 A101567

Keyword

easy,nonn

Author

Paul Barry, Dec 07 2004

Status

approved