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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A031501 Triangle of numbers maxfit[ i ][ j ] = upper bound on number of incidences in a geometry with <= i points and <= j blocks. 0
1, 2, 3, 3, 4, 6, 4, 5, 7, 9, 5, 6, 8, 10, 12, 6, 7, 9, 12, 14, 16, 7, 8, 10, 13, 15, 18, 21, 8, 9, 11, 14, 17, 19, 22, 25, 9, 10, 12, 15, 18, 21, 24, 27, 30, 10, 11, 13, 16, 20, 22, 25, 29, 32, 35, 11, 12, 14, 17, 21, 24, 27, 30, 34, 37, 40, 12, 13, 15, 18, 22, 25, 28 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

LINKS

A. Betten and D. Betten, Linear spaces with at most 12 points, J. Combinatorial Designs, Volume 7, 1999, pp. 119 - 145.

CROSSREFS

Cf. A001200.

Sequence in context: A081536 A023154 A070820 * A203996 A059442 A014410

Adjacent sequences:  A031498 A031499 A031500 * A031502 A031503 A031504

KEYWORD

nonn

AUTHOR

Anton Betten (Anton.Betten(AT)uni-bayreuth.de)

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 16 14:37 EST 2012. Contains 205930 sequences.