|
|
A123179
|
|
a(1)=1 a(2)=121 and a(n)=a(n-1) n 2 n 3 n ... n (n-1) n 1, using concatenation.
|
|
0
|
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
An example of transition complete sequences, when n <= 9. One needs to consider the base 10 complications when n >= 10. The number of digits is given by d(n)=d(n-1)+2n-2 which is A002061.
|
|
LINKS
|
|
|
EXAMPLE
|
a(4)=1213231424341=1213231 + 4 2 4 3 4 1.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
Douglas Stones (dssto1(AT)student.monash.edu.au), Oct 03 2006
|
|
STATUS
|
approved
|
|
|
|