Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136268
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A136268 Cyclic p-roots of prime lengths p(n). +0
1
2, 6, 70, 924, 184756, 2704156, 601080390, 9075135300, 2104098963720, 7648690600760440 (list; graph; listen)
OFFSET

1,1

COMMENT

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 or equal to (2p-2)!/(p-1)!^2.

LINKS

Uffe Haagerup, Cyclic p-roots of prime lengths p and related complex Hadamard matrices, Mar 19, 2008.

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

Cf. A000040, A000142.

Sequence in context: A091458 A087331 A097419 this_sequence A030242 A037293 A129785

Adjacent sequences: A136265 A136266 A136267 this_sequence A136269 A136270 A136271

KEYWORD

easy,more,nonn

AUTHOR

Jonathan Vos Post (jvospost3(AT)gmail.com), Mar 18 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research