[seqfan] Divisible by the digits of a(n-1)

[Eric Angelini]

Hello SeqFans,
a nice permutation of the Naturals, I guess:
a(1)=1
a(n) is always the smallest integer not
yet in the sequence, divisible by all digits
of a(n-1) except zero.
a(2)=2 because 2 is the smallest integer divisible by 1;
a(3)=4 because 4 is the smallest integer divisible by 2;
a(4)=8 because 8 is the smallest integer divisible by 4;
a(5)=16 because 16 is the smallest integer divisible by 8;
a(6)=6 because 6 is the smallest integer divisible by 1 and 6;
a(7)=12 because 12 is the smallest integer divisible by 6;
a(8)=10 because 10 is the smallest integer divisible by 1 and 2;
a(9)=3 because 3 is the smallest integer divisible by 1 (division by 0 skippers);
etc.

S=1,2,4,8,16,6,12,10,3,9,18,24,20,14,...

Best,
É.
Catapulté de mon aPhone