|
%I #7 Jun 23 2019 09:55:37
%S 1,10,2,13,12,3,14,7,15,5,16,4,17,18,6,19,21,23,31,41,51,30,20,26,24,
%T 8,25,35,27,9,29,61,71,81,32,34,28,37,91,47,100,40,38,42,39,36,45,43,
%U 102,46,52,48,49,57,53,103,104,54,56,58,62,72,59,105,50,65,75,63,67,106,82,92,64,68,74,107,108
%N Lexicographically earliest sequence of distinct terms such that a(n) is divisible by one and only one digit of a(n+1).
%H Carole Dubois, <a href="/A326107/b326107.txt">Table of n, a(n) for n = 1..5000</a>
%e The sequence starts with 1, 10, 2, 13, 12, 3,... and we see indeed that a(2) = 10 is the smallest available integer showing a digit 1 as a(1) = 1 must be divisible by one and only one digit of a(2); in the same manner we have a(3) = 2 and we see that a(4) cannot be 11 [because two digits of 11 would divide 2] or 12 [again, the two digits of 12 divide 2]; thus a(4)= 13, etc.
%Y Cf. A326106 [a(n) is not divisible by any digit of a(n+1)], A326108 [a(n) is divisible by two and only two digits of a(n+1)], A326109 [a(n) is divisible by three and only three digits of a(n+1)] and A326110 [a(n) is divisible by four and only four digits of a(n+1)].
%K base,nonn
%O 1,2
%A _Eric Angelini_ and _Carole Dubois_, Jun 06 2019
|
