OFFSET
1,1
COMMENTS
Numbers m such that there exist j and k such that 1 <= j < m and (2*m)! - (2*j)! is divisible by k, but for all m' < m there is no j' with 1 <= j' < m' and (2*m')! - (2*j')! divisible by k, and for all k' with 1 <= k' < k there exist j' and m' with 1 <= j' < m' < m and (2*m')! - (2*j')! divisible by k'.
LINKS
Robert Israel, Table of n, a(n) for n = 1..113
EXAMPLE
MAPLE
f:= proc(n) local S, j, x;
S:= {}:
x:= 1:
for j from 1 do
x:=x*2*j*(2*j-1) mod n;
if member(x, S) then return j fi;
S:= S union {x}
od
end proc:
R:= 2: m:= 2: count:= 1:
for k from 2 while count < 70 do
v:= f(k);
if v > m then R:= R, v; count:= count+1; m:= v;
fi
od:
R;
CROSSREFS
KEYWORD
nonn
AUTHOR
Robert Israel, Nov 19 2024
STATUS
approved