OFFSET
1,1
COMMENTS
It has been conjectured by Michael B Rees that there exists for every prime a Wendt determinant divisible by that prime. However the conjecture has been proved for all prime divisors equivalent to -1 (mod 6) - (see Lehmer link below).
LINKS
Charles Helou, On Wendt's Determinant, Math. Comp., 66 (1997) No. 219, 1341-1346.
Emma Lehmer, On a Resultant Connected with Fermat's Last Theorem, Bull. Amer. Math. Soc. 41 (1935), 864-867.
Eric Weisstein's World of Mathematics, Circulant matrix.
Wikipedia, Circulant matrix.
EXAMPLE
a(5) = 5 because Wendt(5) = 3751 = 11^2*131. It is divisible by prime(5) = 11 and Wendt(5) is the least Wendt determinant divisible by 11.
MATHEMATICA
Wendt[n_]:=Module[{x}, Resultant[x^n-1, (1+x)^n-1, x]];
findW[n_]:= Module[{m=1}, While[!IntegerQ[Wendt[m]/n]||Mod[m, 6]==0, m++]; m];
Table[findW[Prime[n]], {n, 1, 100}]
CROSSREFS
KEYWORD
nonn
AUTHOR
Frank M Jackson and Michael B Rees, Jun 11 2020
STATUS
approved