OFFSET
1,2
COMMENTS
Numbers m such that there is k such that for every m' < m, there exist j and k' such that 1 <= j < k' <= k and m' divides (2*k')! - (2*j)!, but there do not exist j and k' such that 1 <= j < k' <= k and m divides (2*k')! - (2*j)!.
LINKS
Robert Israel, Table of n, a(n) for n = 1..113
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:
J:= 1: m:= 2: count:= 1:
for k from 2 while count < 70 do
v:= f(k);
if v > m then J:= J, k; count:= count+1; m:= v;
fi
od:
J;
CROSSREFS
KEYWORD
nonn
AUTHOR
Robert Israel, Nov 19 2024
STATUS
approved