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”).

Take a(n), sort its digits into ascending order, 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 its digits.
0

%I #12 May 10 2022 02:36:43

%S 10,20,30,40,50,52,60,70,80,90,98,100,105,106,108,110,120,130,140,150,

%T 160,170,180,186,190,198,200,205,220,230,240,250,251,260,270,274,280,

%U 290,298,300,302,330,340,350,360,370,380,390,398,400,405,410,440,450,460,470,480,490,498,500,502,510,511

%N Take a(n), sort its digits into ascending order, 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 its digits.

%C In sorting a number, leading zeros are erased.

%C This is the lexicographically earliest sequence of distinct positive terms with this property.

%e a(1) = 10, which sorted is 1 (leading zeros are erased); 10/1 leaves a remainder 0, which is present in a(1);

%e a(2) = 20, which sorted is 2 (leading zeros are erased); 20/2 leaves a remainder 0, which is present in a(2);

%e ...

%e a(6) = 52, which sorted is 25; 52/25 leaves a remainder 2, which is present in a(6); etc.

%t lst={};k=1;Do[While[!StringContainsQ[ToString@k,ToString@Mod[#2,#]&@@(Sort@{k,FromDigits@Sort@IntegerDigits@k})],k++];AppendTo[lst,k];k++,{n,62}];lst (* _Giorgos Kalogeropoulos_, May 08 2022 *)

%Y Cf. A090053.

%K base,nonn

%O 1,1

%A _Eric Angelini_ and _Carole Dubois_, Mar 01 2021