Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A101564
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A101564 a(n)=sum{k=0..n, (-1)^A010060(n-k)*if(mod(n+1,k+1)=0,1,0)*10^k}. +0
1
1, 9, 99, 991, 9999, 100091, 1000001, 9999009, 100000099, 1000009991, 10000000001, 100000099109, 1000000000001, 9999999000009, 100000000010099, 999999990000991, 9999999999999999, 100000000100100091 (list; graph; listen)
OFFSET

0,2

CROSSREFS

Cf. A101563, A051731.

Sequence in context: A100681 A043044 A069000 this_sequence A070843 A108908 A116260

Adjacent sequences: A101561 A101562 A101563 this_sequence A101565 A101566 A101567

KEYWORD

easy,nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research