A235460 a(1)=2. For n>1, assume a(n-1) has decimal expansion abcdefghij (with at most ten digits, where some of j,i,h, ... may be missing). Then a(n) = sum 11...1 (with a 1's) + 22...2 (with b 2's) + 33...3 (with c 3's) + ...

2, 11, 3, 111, 6, 111111, 21, 13, 223, 366, 555666, 1733331, 2224228

Offset

1,1

Comments

See A235400 for the analogous sequence where we number the digits starting with 9 at the rightmost digit.

References

Rodolfo Kurchan, Problems with repdigits, to appear in Proceedings of Gathering for Gardner 2014 conference

Links

Table of n, a(n) for n=1..13.

Example

2 means two 1's = 11; 11 means one 1 + one 2 = 3; 3 means 111; 111 means 1+2+3 = 6; 6 means 111111 = 1+2+3+4+5+6 = 21; 21 means 11+2 = 13; etc.

Crossrefs

Cf. A235400.

Sequence in context: A109858 A082266 A070840 * A082264 A070532 A038217

Adjacent sequences: A235457 A235458 A235459 * A235461 A235462 A235463

Keyword

nonn,base

Author

Rodolfo Kurchan, Jan 10 2014

Extensions

Edited by N. J. A. Sloane, Jan 24 2014

Status

approved