login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A136268
Cyclic p-roots of prime lengths p(n).
0
2, 6, 70, 924, 184756, 2704156, 601080390, 9075135300, 2104098963720, 7648690600760440, 118264581564861424, 442512540276836779204, 107507208733336176461620, 1678910486211891090247320, 410795449442059149332177040
OFFSET
1,1
COMMENTS
In this paper it is proved, that for every prime number p, the set of cyclic p-roots in C^p is finite. Moreover the number of cyclic p-roots counted with multiplicity is equal to (2p-2)!/(p-1)!^2. In particular, the number of complex circulant Hadamard matrices of size p, with diagonal entries equal to 1, is less than or equal to (2p-2)!/(p-1)!^2.
FORMULA
a(n) = (2*p_n - 2)!/(p_n - 1)!^2 where p_n = prime(n) = A000040(n).
a(n) = A000142(2*A000040(n)-2)/((A000142(A000040(n)-1))^2).
CROSSREFS
Sequence in context: A219037 A156458 A244494 * A030242 A037293 A129785
KEYWORD
easy,nonn
AUTHOR
Jonathan Vos Post, Mar 18 2008
STATUS
approved