login
Slowest increasing sequence such that a(n) has a copy of itself in a(n+a(n)), with a(0)=0 and a(1)=1.
0

%I #2 Mar 31 2012 13:46:51

%S 0,1,10,11,12,13,14,15,16,17,18,19,100,101,110,111,112,113,130,131,

%T 140,141,150,151,160,161,170,171,180,181,190,191,192,193,194,195,196,

%U 197,198,199,200,201,202,203,204,205,206,207,208,209,210,211,212,213,214

%N Slowest increasing sequence such that a(n) has a copy of itself in a(n+a(n)), with a(0)=0 and a(1)=1.

%e a(3) is 11; string "11" can be found in "110", which is a(3+a(3)) = a(14).

%K base,easy,nonn

%O 0,3

%A _Eric Angelini_, Feb 18 2005