A147637
a(n) = largest n-distinct-decimal-digit number such that the string formed by the last k digits is divisible by k for any 1<=k<=n.
Original entry on oeis.org
9, 98, 984, 9876, 98720, 987540, 9864120, 98765120, 876351240, 9876351240
Offset: 1
A140501 Ten-digit numbers with all distinct digits such that the string formed by the last k digits is divisible by k for any k <=10.
A147636 a(n) = least n-distinct-decimal-digit number such that the string formed by the last k digits is divisible by k for any 1<=k<=n.
A147647
Nine-digit numbers with all distinct digits such that the string formed by the last k digits is divisible by k for any 1<=k<=9.
Original entry on oeis.org
123567480, 123675840, 123756480, 126573840, 132576840, 132657480, 132765840, 135648720, 135726840, 138546720, 138675240, 147528360, 153276840, 153672480, 153768240, 156237840, 156348720, 162573480, 165327840, 165378240, 165438720
Offset: 1
A147749
Eight-digit numbers with all distinct digits with property that the string formed by the last k digits is divisible by k for any 1<=k<=8.
Original entry on oeis.org
12495360, 12573480, 12576840, 12579360, 12597840, 12639840, 12657480, 12738960, 12765840, 12789360, 12843960, 12894360, 12957360, 12975840, 12978360, 13276840, 13297840, 13567480, 13579240, 13672480, 13675840
Offset: 1
-
se8={};Do[If[8-Length@Union@IntegerDigits[n]==Mod[Mod[n,10^3],24]== Mod[Mod[n,10^6],6]==Mod[Mod[n,10^7],7]==0, AppendTo[se8,n]],{n,10000020,99999999,20}];se8
Sort[FromDigits/@Select[Select[Flatten[Permutations/@Subsets[Range[0,9],{8}],1],First[#]>0&],And@@Table[Divisible[FromDigits[Take[#,-i]],i],{i,8}]&]] (* Harvey P. Dale, Aug 19 2013 *)
A331475
a(n) is the smallest n-digit number using each digit 0 to n-1 once, such that the numbers formed by its last k digits are divisible by k, (k = 1..n).
Original entry on oeis.org
0, 10, 102, 3012, 13240, 123540, 3516240, 16453720, 123567480, 9123567480
Offset: 1
a(3) = 3012 because 2, 12, 012, 3012 are divisible by 1, 2, 3, 4 and it is the least such number with distinct digits 0 to 3.
-
ok[n_] := AllTrue[Range@ IntegerLength@ n, Mod[ Mod[n, 10^#], #] == 0 &]; a[n_] := SelectFirst[ FromDigits /@ Permutations[Range[0, n-1]], # >= 10^(n-1) - 1 && ok[#] &]; Array[a, 10] (* Giovanni Resta, May 04 2020 *)
A334537
a(n) is the largest n-digit number using each digit 0 to n-1 once, such that the numbers formed by its last k digits are divisible by k, (k = 1..n).
Original entry on oeis.org
0, 10, 210, 3120, 43120, 543120, 6531420, 76351240, 876351240, 9876351240
Offset: 1
a(4) = 43120 because 0, 20, 120, 3120 and 43120 are divisible by 1, 2, 3, 4 and 5, and it is the largest such number with distinct digits 0 to 4.
Showing 1-5 of 5 results.
Comments