|
|
A266181
|
|
Numbers n such that n == d_1 (mod 2), n == d_2 (mod 3), n == d_3 (mod 4) etc., where d_1 d_2 d_3 ... is the decimal expansion of n.
|
|
1
|
|
|
1, 11311, 1032327, 1210565, 11121217, 101033565, 111214177, 113411719, 121254557, 123254387, 10333633323, 12105652565, 11121314781937
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Definition assumes that d_i are residues, as otherwise 2,3,...,9 are also terms. - Chai Wah Wu, Jun 23 2020
|
|
LINKS
|
|
|
EXAMPLE
|
11311 == 1 (mod 2)
11311 == 1 (mod 3)
11311 == 3 (mod 4)
11311 == 1 (mod 5)
11311 == 1 (mod 6)
|
|
MATHEMATICA
|
Select[Range@ 2000000, First@ Union@ Function[k, MapIndexed[Mod[k, First@ #2 + 1] == #1 &, IntegerDigits@ k]]@ # &] (* Michael De Vlieger, Dec 30 2015 *)
|
|
PROG
|
(Python)
for b in range (3, 11):
....for i in range (10**(b-2), 13*10**(b-3)):
........si, k, kk=str(i), 0, i
........for j in range(1, b):
............if int(si[len(str(i))-j])==kk%(b+1-j):
................k=k+1
........if k==len(str(i)):
............print (i)
(PARI) isok(n) = {my(d = digits(n)); for (i=1, #d, if (n % (i+1) != d[i], return (0)); ); return (1); } \\ Michel Marcus, Dec 30 2015
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|