Search: id:a158242
|
| |
|
|
A158242
|
|
Smallest n-digit number with distinct digits such that every k-digit substring (k <= n) taken from the left is divisible by k (k = 1..n).
|
|
+0
7
|
| |
|
|
|
OFFSET
|
1,2
|
|
|
COMMENTS
|
Years ago, the columnist Alex Bellos asked John Conway for some math puzzles for his column. A few days after Conway's death in 2020, Bellos published two of those puzzles. a(10) of this sequence is the solution to the second puzzle. See the Bellos (2020) link. - Alonso del Arte, Apr 21 2020
|
|
|
LINKS
|
|
|
|
EXAMPLE
|
12965408, for instance, is in the sequence because 1|1, 2|12, 3|129, 4|1296, 5|12965, 6|129654, 7|1296540, 8|12965408. It's a(8).
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn,base,fini,full
|
|
|
AUTHOR
|
|
|
|
EXTENSIONS
|
|
|
|
STATUS
|
approved
|
| |
|
Search completed in 0.003 seconds
|
