|
|
COMMENTS
|
To be precise, for n even, a(n) is the number of STS's on 3n+1 elements, and for n odd, a(n) is the number of STS's on 3n elements. [From Franklin T. Adams-Watters, Apr 10 2010]
|
|
|
REFERENCES
|
L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 304.
CRC Handbook of Combinatorial Designs, 1996, p. 70.
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).
|
