cp's OEIS Frontend

A342142 Take a(n), reverse it, divide the larger of the two numbers by the smaller and keep only the remainder: this remainder is present in a(n) as a substring of digits.

%I A342142 #10 May 10 2022 02:36:51
%S A342142 10,20,25,30,40,50,52,60,70,80,89,90,98,100,101,110,138,180,200,202,
%T A342142 220,295,300,303,330,400,404,410,440,500,505,510,511,520,521,530,540,
%U A342142 550,592,600,606,660,700,707,770,800,808,810,820,831,880,890,899,900,909,940,990,998,1000,1001,1010,1089
%N A342142 Take a(n), reverse it, divide the larger of the two numbers by the smaller and keep only the remainder: this remainder is present in a(n) as a substring of digits.
%C A342142 In reversing a number, leading zeros are erased.
%C A342142 This is the lexicographically earliest sequence of distinct positive terms with this property.
%e A342142 a(1) = 10, which reversed is 1 (leading zeros are erased); 10/1 leaves a remainder 0, which is present in a(1);
%e A342142 a(2) = 20, which reversed is 2 (leading zeros are erased); 20/2 leaves a remainder 0, which is present in a(2);
%e A342142 a(3) = 25, which reversed is 52; 52/25 leaves a remainder 2, which is present in a(3);
%e A342142 ...
%e A342142 a(50) = 831, which reversed is 138; 831/138 leaves a remainder 3, which is present in a(50); etc.
%t A342142 lst={};k=1;Do[While[!StringContainsQ[ToString@k,ToString@Mod[#2,#]&@@(Sort@{k,IntegerReverse@k})],k++];AppendTo[lst,k];k++,{n,61}];lst (* _Giorgos Kalogeropoulos_, May 08 2022 *)
%Y A342142 Cf. A342114 (where the terms of this sequence are used).
%K A342142 base,nonn
%O A342142 1,1
%A A342142 _Eric Angelini_ and _Carole Dubois_, Mar 01 2021