login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A000510
Maximal number of points in PG(2,q) with at most 3 on a line (next term is 21 or 22).
1
7, 9, 9, 11, 15, 15, 17
OFFSET
2,1
REFERENCES
J. W. P. Hirschfeld and L. Storme, The packing problem in statistics, coding theory and finite projective spaces, J. Statist. Plann. Inference 72 (1998), no. 1-2, 355-380.
CROSSREFS
Cf. A000509.
Sequence in context: A143959 A121313 A111204 * A262310 A167628 A112954
KEYWORD
nonn,hard,more
AUTHOR
J. W. P. Hirschfeld [ jwph(AT)sussex.ac.uk ]
STATUS
approved