The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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). 1
 0, 10, 102, 3012, 13240, 123540, 3516240, 16453720, 123567480, 9123567480 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS a(n) = A147636(n) for n=1, 2, 3, 9 and 10. LINKS EXAMPLE 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. MATHEMATICA 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 *) CROSSREFS Cf. A147636, A158242, A220491. Sequence in context: A061630 A062806 A336952 * A158240 A087393 A037596 Adjacent sequences:  A331472 A331473 A331474 * A331476 A331477 A331478 KEYWORD base,fini,full,nonn AUTHOR Eduardo P. Feitosa, May 03 2020 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 18 10:19 EDT 2021. Contains 343995 sequences. (Running on oeis4.)