|
Search: id:A075859
|
|
|
| A075859 |
|
a(n) = n concatenated with n 1's and n. |
|
+0
1
|
|
| 111, 2112, 31113, 411114, 5111115, 61111116, 711111117, 8111111118, 91111111119, 10111111111110, 111111111111111, 1211111111111112, 13111111111111113, 141111111111111114, 1511111111111111115
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
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
|
M. L. Perez et al., eds., Smarandache Notions Journal
|
|
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.
|
|
CROSSREFS
|
Sequence in context: A102782 A137465 A101152 this_sequence A008396 A129051 A012039
Adjacent sequences: A075856 A075857 A075858 this_sequence A075860 A075861 A075862
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Jason Earls (zevi_35711(AT)yahoo.com), Oct 15 2002
|
|
EXTENSIONS
|
More terms from Donald Sampson (marsquo(AT)hotmail.com), Dec 09 2003
|
|
|
Search completed in 0.002 seconds
|
