|
%I #8 Jun 23 2019 09:56:13
%S 1,111,113,1011,131,1101,133,117,119,171,139,1110,112,114,116,121,
%T 1112,118,122,211,1113,137,1114,212,124,141,311,1115,115,151,1116,123,
%U 313,1117,1118,221,1119,331,1121,1131,333,191,1141,177,1013,1151,1161,193,1171,1181,1191,1031,1211,711,199,1311
%N Lexicographically earliest sequence of distinct terms such that a(n) is divisible by three and only three digits of a(n+1).
%H Carole Dubois, <a href="/A326109/b326109.txt">Table of n, a(n) for n = 1..5000</a>
%e The sequence starts with 1, 111, 113, 1011, 131, 1101, 133, ... and we see indeed that a(2) = 111 is the smallest available integer showing three digits that divide a(1) = 1; in the same manner we have a(3) = 113 [all three digits divide 111], a(4) = 1011 [the three 1s of 1011 divide 113], a(5) = 131 [all three digits divide 1011], etc.
%Y Cf. A326106 [a(n) is not divisible by any digit of a(n+1)], A326107 [a(n) is divisible by one and only one digit of a(n+1)], A326108 [a(n) is divisible by two and only two 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
|
