cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-9 of 9 results.

A001201 Number of Steiner triple systems (STS's) on 6n+1 or 6n+3 elements.

Original entry on oeis.org

1, 1, 30, 840, 1197504000, 60281712691200, 1348410350618155344199680000
Offset: 0

Views

Author

Keywords

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. - Franklin T. Adams-Watters, Apr 10 2010

Examples

			There are 1197504000 STS's on 13 elements.
		

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).

Crossrefs

Indexed by A047241. Cf. A030128, A030129, A051390.

A051390 Number of nonisomorphic Steiner quadruple systems (SQS's) of order n.

Original entry on oeis.org

1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 4, 0, 1054163
Offset: 1

Views

Author

Keywords

Examples

			There are 4 nonisomorphic SQS's on 14 points.
		

References

  • CRC Handbook of Combinatorial Designs, 1996, circa p. 70.
  • A. Hartman and K. T. Phelps, Steiner quadruple systems, pp. 205-240 of Contemporary Design Theory, ed. Jeffrey H. Dinitz and D. R. Stinson, Wiley, 1992.

Crossrefs

See A124120, A124119 for other versions of this sequence. The present entry is the official version.

Formula

a(n) = 0 unless n = 1 or n == 2 or 4 (mod 6).

A030128 Number of Steiner triple systems (STS's) on n elements.

Original entry on oeis.org

1, 0, 1, 0, 0, 0, 30, 0, 840, 0, 0, 0, 1197504000, 0, 60281712691200, 0, 0, 0, 1348410350618155344199680000
Offset: 1

Views

Author

Keywords

References

  • L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 304.
  • CRC Handbook of Combinatorial Designs, 1996, p. 70.

Crossrefs

A124119 Number of nonisomorphic Steiner quadruple systems (SQS's) S(3,4,v) on v = 6n+2 or 6n+4 points.

Original entry on oeis.org

1, 1, 4, 1054163
Offset: 1

Views

Author

N. J. A. Sloane, Nov 30 2006

Keywords

Comments

A051390 is the official version of this sequence and has all the references etc.

Examples

			There are 4 nonisomorphic SQS's on 14 points.
		

Crossrefs

A124120 Number of nonisomorphic Steiner quadruple systems (SQS's) S(3,4,n) on n points.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 4, 0, 1054163
Offset: 1

Views

Author

N. J. A. Sloane, Nov 30 2006

Keywords

Examples

			There are 4 nonisomorphic SQS's on 14 points.
		

Crossrefs

A051390 is the official version of this sequence and has all the references etc.

A066701 Triangle giving number of nonisomorphic minimal covering designs with parameters (n, k, k-1) (designs achieving the covering number C(n,k,k-1) given in A066010), for n >= 2, 2 <= k <= n.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 5, 1, 6, 1, 1, 1, 1, 1, 77, 3, 2, 1, 1, 1, 1, 58, 1, 40, 1, 20, 1, 1, 1, 1, 2
Offset: 2

Views

Author

N. J. A. Sloane, Jan 11 2002

Keywords

Comments

C(v,k,t) is the smallest number of k-subsets of an n-set such that every t-subset is contained in at least one of the k-subsets. This sequence says how many different solutions there are for C(n,k,k-1).

References

  • CRC Handbook of Combinatorial Designs, 1996, p. 263.
  • W. H. Mills and R. C. Mullin, Coverings and packings, pp. 371-399 of Jeffrey H. Dinitz and D. R. Stinson, editors, Contemporary Design Theory, Wiley, 1992.

Crossrefs

Cf. A066010. A030129 gives entries in second column in the cases when a Steiner triple system exists.
A051390 gives entries in 3rd column in the cases when a Steiner quadruple system exists.

A187567 Number of Steiner Systems S(2,4,n).

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 18, 0, 0
Offset: 1

Views

Author

N. J. A. Sloane, Mar 11 2011

Keywords

Comments

S(2,4,n) exists if and only if n == 1 or 4 (mod 12).
a(28) >= 4653.

Crossrefs

A051391 Number of nonisomorphic Steiner triple systems (STS's) S(2,3,v) on v = 6n+1 or 6n+3 points.

Original entry on oeis.org

1, 1, 1, 1, 2, 80, 11084874829
Offset: 1

Views

Author

Keywords

Examples

			There are 2 nonisomorphic STS's on 13 points.
		

References

  • L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 304.
  • CRC Handbook of Combinatorial Designs, 1996, p. 70.

Crossrefs

A282746 Number of 2-(n,3,lambda_min) designs.

Original entry on oeis.org

1, 1, 3077244, 1, 960
Offset: 6

Views

Author

N. J. A. Sloane, Mar 05 2017

Keywords

Comments

The corresponding values of lambda_min are 2, 1, 6, 1, 2.
Other known terms are a(12) = 242995846, a(13) = 2, a(15) = 80, a(19) = 11084874829.

Crossrefs

Cf. A030129.

Extensions

Edited by Andrei Zabolotskii, Jul 08 2025
Showing 1-9 of 9 results.