login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A206712 Total number of distinct Hadamard matrices of order n. 2
2, 8, 0, 768, 0, 0, 0, 4954521600, 0, 0, 0, 20251509535014912000, 0, 0, 0, 88526812916367202104587059200000, 0, 0, 0, 3776127947893930552689423154306445475840000000, 0, 0, 0, 92624181047745713568610317051197596401168530978226831360000000, 0, 0, 0, 886156947284057553944669848348035536068124589065755283423684984832000000000000, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
a(n) is the total number of distinct Hadamard matrices of order n, ignoring all equivalences.
LINKS
F. J. Aragon Artacho, J. M. Borwein, M. K. Tam, Douglas-Rachford Feasibility Methods for Matrix Completion Problems, March 2014.
H. Kharaghani and B. Tayfeh-Rezaie, Hadamard matrices of order 32
FORMULA
a(4n) = A206711(n) = A048615(n)/A048616(n) * (2^n * n!)^2.
For n>1, a(4n+1) = a(4n+2) = a(4n+3) = 0.
CROSSREFS
Sequence in context: A288873 A160636 A282626 * A293777 A200704 A257955
KEYWORD
nonn,nice
AUTHOR
Brendan McKay, Feb 11 2012 (entered by N. J. A. Sloane)
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 08:27 EDT 2024. Contains 371964 sequences. (Running on oeis4.)