Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A113978
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A113978 a(n)=Sum(d|n)(10^(n-d)). +0
1
1, 11, 101, 1101, 10001, 111001, 1000001, 11010001, 101000001, 1100100001, 10000000001, 111101000001, 1000000000001, 11000010000001, 101010000000001, 1101000100000001, 10000000000000001, 111001001000000001 (list; graph; listen)
OFFSET

0,2

COMMENT

A074854 in base 2. Stacking the elements gives the triangle A051731.

FORMULA

G.f.: Sum_{k>0} 10^(k-1)*x^k/(1-10^(k-1)*x^k).

PROGRAM

(PARI) a(n)=if(n<1, 0, 10^n*polcoeff(sum(k=1, n, 10/(10-x^k), x*O(x^n)), n))

CROSSREFS

Sequence in context: A089183 A113999 A068166 this_sequence A006943 A073030 A097649

Adjacent sequences: A113975 A113976 A113977 this_sequence A113979 A113980 A113981

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Nov 11 2005

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 July 23 17:35 EDT 2008. Contains 142285 sequences.


AT&T Labs Research