|
|
A280171
|
|
a(n) is the least positive number whose divisors have all possible residues mod n.
|
|
0
|
|
|
1, 2, 6, 12, 40, 30, 84, 120, 288, 270, 990, 420, 936, 1638, 840, 2160, 5100, 4410, 8208, 5940, 3360, 6930, 12420, 10920, 14400, 19890, 28080, 27300, 48720, 43890, 37200, 73440, 84480, 151470, 97440, 107100, 139860, 139650, 120120, 83160, 196800, 395850, 216720, 318780, 191520, 217350, 118440, 546000, 282240, 1222650
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
a(n) <= n!
a(n) is divisible by n.
|
|
LINKS
|
|
|
EXAMPLE
|
a(4) = 12: the divisors of 12 include 4, 1, 2, 3 == 0, 1, 2, 3 (mod 4).
a(5) = 40: the divisors of 40 include 5, 1, 2, 8, 4 == 0, 1, 2, 3, 4 (mod 5).
|
|
MAPLE
|
A[1]:= 1:
for k from 2 to 10^6 do
V:= numtheory:-divisors(k);
for m from 2 to nops(V) do
if not(assigned(A[m])) and (map(`modp`, V, m) = {$0..m-1}) then
A[m]:= k
fi
od
od:
seq(A(n), n=1..49);
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|