login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A000952 Orders n == 2 (mod 4) of conference matrices.
(Formerly M1574 N0615)
5
2, 6, 10, 14, 18, 26, 30, 38, 42, 46, 50, 54, 62 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

A conference matrix of order n is an n X n {-1,0,+1} matrix A such that A A' = (n-1)I.

If n == 2 (mod 4) then a necessary condition is that n-1 is a sum of 2 squares. It is conjectured that this condition is also sufficient. If n == 2 mod 4 and n-1 is a prime or prime power the condition is automatically satisfied.

REFERENCES

V. Belevitch, Conference matrices and Hadamard matrices, Ann. Soc. Scientifique Bruxelles, 82 (I) (1968), 13-32.

CRC Handbook of Combinatorial Designs, 1996, Chapter 52.

F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Elsevier-North Holland, 1978, p. 56.

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Joerg Arndt, Some relevant gp programs

EXAMPLE

The essentially unique conference matrix of order 6:

0 +1 +1 +1 +1 +1

+1 0 +1 -1 -1 +1

+1 +1 0 +1 -1 -1

+1 -1 +1 0 +1 -1

+1 -1 -1 +1 0 +1

+1 +1 -1 -1 +1 0

CROSSREFS

Sequence in context: A103747 A182991 A194282 * A180216 A164302 A190883

Adjacent sequences:  A000949 A000950 A000951 * A000953 A000954 A000955

KEYWORD

nonn,hard,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

66 seems to be the smallest order for which it is not known if a matrix exists.

Edited by N. J. A. Sloane (njas(AT)research.att.com), Mar 13 2008, Mar 16 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 12 21:29 EST 2012. Contains 205433 sequences.