|
| |
|
|
A075859
|
|
a(n) = n concatenated with n 1's and n.
|
|
0
|
|
|
|
111, 2112, 31113, 411114, 5111115, 61111116, 711111117, 8111111118, 91111111119, 10111111111110, 111111111111111, 1211111111111112, 13111111111111113, 141111111111111114, 1511111111111111115
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
All terms are divisible by 3. - Donald Sampson (marsquo(AT)hotmail.com), Dec 09 2003
|
|
|
REFERENCES
|
J. Earls, On Smarandache Repunit N Numbers, Smarandache Notions Journal, (to appear).
|
|
|
LINKS
|
Table of n, a(n) for n=1..15.
|
|
|
FORMULA
|
a(n) = n * 10^(n+L) + 10^L * R + n, where R is the n-th repunit and L is the number of decimal digits of n.
|
|
|
MAPLE
|
P:=proc(i) local a, n; a:=111; print(a); for n from 2 by 1 to i do a:=n*10^floor(evalf(1+log10(n)+n, 100))+((10^n-1)/9)*10^floor(evalf(1+log10(n), 100))+n; print(a); od; end: P(100); [From Paolo P. Lava, Nov 14 2008]
|
|
|
CROSSREFS
|
Sequence in context: A102782 A137465 A101152 * A008396 A129051 A012039
Adjacent sequences: A075856 A075857 A075858 * A075860 A075861 A075862
|
|
|
KEYWORD
|
base,easy,nonn,less
|
|
|
AUTHOR
|
Jason Earls (zevi_35711(AT)yahoo.com), Oct 15 2002
|
|
|
EXTENSIONS
|
More terms from Donald Sampson (marsquo(AT)hotmail.com), Dec 09 2003
|
|
|
STATUS
|
approved
|
| |
|
|
