|
Search: id:A053063
|
|
|
| A053063 |
|
Alternately append n to beginning or end of previous term. |
|
+0
1
|
|
| 1, 21, 213, 4213, 42135, 642135, 6421357, 86421357, 864213579, 10864213579, 1086421357911, 121086421357911, 12108642135791113
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
Felice Russo, A set of new Smarandache functions, sequences and conjectures in number theory, American Research Press 2000
|
|
LINKS
|
M. L. Perez et al., eds., Smarandache Notions Journal
|
|
FORMULA
|
a(n)=(1/2)*(1+(-1)^n)*(n*10^(floor(1+log10(a(n-1))))+a(n-1))+(1/2)*(1-(-1)^n)*(a(n-1)*10^(floor(1+log10(n)))+n), with a(0)=1 [From Paolo P. Lava (ppl(AT)spl.at), Oct 29 2008]
|
|
MAPLE
|
P:=proc(i) local a, n; a:=1; print(a); for n from 2 by 1 to i do a:=1/2*(1+(-1)^n)*(n*10^trunc(evalf(floor(1+log10(a)), 100))+a)+1/2*(1-(-1)^n)*(a*10^trunc(evalf(floor(1+log10(n)), 100))+n); print(a); od; end: P(100); [From Paolo P. Lava (ppl(AT)spl.at), Oct 29 2008]
|
|
CROSSREFS
|
Sequence in context: A133355 A041846 A120786 this_sequence A060933 A075282 A165223
Adjacent sequences: A053060 A053061 A053062 this_sequence A053064 A053065 A053066
|
|
KEYWORD
|
easy,nonn,base
|
|
AUTHOR
|
Felice Russo (felice.russo(AT)katamail.com), Feb 25 2000
|
|
|
Search completed in 0.002 seconds
|
