login
a(1) = 111, a(n) = the smallest squarefree number > a(n-1) which contains all the digits of a(n-1).
0

%I #4 Mar 30 2012 17:29:07

%S 111,1011,1101,1110,10011,10101,10110,11001,11010,100011,100101,

%T 100110,101001,101010,110001,110010,1000011,1000101,1000110,1001001,

%U 1001010,1010001,1010010,1100010,10000011,10000101,10000110,10001001,10001010

%N a(1) = 111, a(n) = the smallest squarefree number > a(n-1) which contains all the digits of a(n-1).

%C Conjecture: Terms contain exactly three 1's digits and the rest 0's digits.

%Y Cf. A077712.

%K base,nonn

%O 1,1

%A _Ray Chandler_, Aug 06 2003