login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

a(1)=6, a(n) = smallest integer not previously used which contains a digit from a(n-1).
9

%I #7 Oct 13 2019 10:10:15

%S 6,16,1,10,0,20,2,12,11,13,3,23,21,14,4,24,22,25,5,15,17,7,27,26,28,8,

%T 18,19,9,29,32,30,31,33,34,35,36,37,38,39,43,40,41,42,44,45,46,47,48,

%U 49,54,50,51,52,53,55,56,57,58,59,65,60,61,62,63,64,66,67,68,69,76,70

%N a(1)=6, a(n) = smallest integer not previously used which contains a digit from a(n-1).

%C Cf. A107353 a(1)=0, A107772 a(1)=1, A107773 a(1)=2, A107774 a(1)=3, A107775 a(1)=4, A107776 a(1)=5, A107778 a(1)=7, A107779 a(1)=8, A107780 a(1)=9, A107781 a(1)=10

%t f[l_] := Block[{c = 0}, While[ MemberQ[l, c] || Intersection @@ IntegerDigits /@{Last[l], c}=={}, c++ ];Return[Append[l, c]]];Nest[f, {6}, 70] (* _Ray Chandler_, Jul 19 2005 *)

%Y Cf. A107353, A107772, A107773, A107774, A107775, A107776, A107778, A107779, A107780, A107781.

%K base,nonn

%O 1,1

%A _Eric Angelini_ & _Zak Seidov_, May 24 2005