|
Search: id:A055495
|
|
|
| A055495 |
|
Numbers n such that there exists a pair of mutually orthogonal Latin squares of order n. |
|
+0
2
|
|
| 3, 4, 5, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
n such that there exists a pair of orthogonal 1-factorizations of K_{n,n}.
|
|
REFERENCES
|
B. Alspach, K. Heinrich and G. Liu, Orthogonal factorizations of graphs, pp. 13-40 of Contemporary Design Theory, ed. J. H. Dinizt and D. R. SAtinson, Wiley, 1992.
|
|
FORMULA
|
All n >=3 except 6.
|
|
CROSSREFS
|
Sequence in context: A049465 A071054 A033545 this_sequence A072442 A063992 A039233
Adjacent sequences: A055492 A055493 A055494 this_sequence A055496 A055497 A055498
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Dec 07 2000
|
|
|
Search completed in 0.004 seconds
|
