login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A101564 a(n)=sum{k=0..n, (-1)^A010060(n-k)*if(mod(n+1,k+1)=0,1,0)*10^k}. 0
1, 9, 99, 991, 9999, 100091, 1000001, 9999009, 100000099, 1000009991, 10000000001, 100000099109, 1000000000001, 9999999000009, 100000000010099, 999999990000991, 9999999999999999, 100000000100100091 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

CROSSREFS

Cf. A101563, A051731.

Sequence in context: A100681 A043044 A069000 * A070843 A108908 A116260

Adjacent sequences:  A101561 A101562 A101563 * A101565 A101566 A101567

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Dec 07 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 13:24 EST 2012. Contains 206031 sequences.