|
| |
|
|
A075858
|
|
n followed by n 1's.
|
|
0
| |
|
|
11, 211, 3111, 41111, 511111, 6111111, 71111111, 811111111, 9111111111, 101111111111, 1111111111111, 12111111111111, 131111111111111, 1411111111111111, 15111111111111111, 161111111111111111
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
REFERENCES
| J. Earls, On Smarandache Repunit N Numbers, Smarandache Notions Journal, (to appear).
|
|
|
LINKS
| M. L. Perez et al., eds., Smarandache Notions Journal
|
|
|
FORMULA
| a(n) = n*10^n+(10^n-1)/9.
G.f.: x*(11-20*x)/((1-x)*(1-20*x+100*x^2)). a(n)==20*a(n-1)-100*a(n-2)-9, n>1. - Michael Somos, Oct 29, 2002
|
|
|
PROG
| (PARI) a(n)=if(n<1, 0, n*10^n+(10^n-1)/9)
|
|
|
CROSSREFS
| Cf. A068817.
Sequence in context: A068836 A069628 A069613 * A136307 A038399 A053547
Adjacent sequences: A075855 A075856 A075857 * A075859 A075860 A075861
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Jason Earls (zevi_35711(AT)yahoo.com), Oct 15 2002
|
| |
|
|
