1,2
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.
a(4)=1213231424341=1213231 + 4 2 4 3 4 1.
Cf. A108713, A002061.
Sequence in context: A178192 A135825 A082215 * A136094 A053885 A068490
Adjacent sequences: A123176 A123177 A123178 * A123180 A123181 A123182
nonn,base
Douglas Stones (dssto1(AT)student.monash.edu.au), Oct 03 2006