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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
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.

LINKS

Table of n, a(n) for n=2..8.

CROSSREFS

Cf. A000509.

Sequence in context: A143959 A121313 A111204 * A262310 A167628 A112954

Adjacent sequences:  A000507 A000508 A000509 * A000511 A000512 A000513

KEYWORD

nonn,hard,more

AUTHOR

J. W. P. Hirschfeld [ jwph(AT)sussex.ac.uk ]

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 20 14:50 EDT 2019. Contains 326152 sequences. (Running on oeis4.)