|
Search: id:A000509
|
|
|
| A000509 |
|
Size of second largest n-arc in PG(2,q), where q runs through the primes and prime powers >= 7. |
|
+0
2
|
|
| 6, 6, 8, 10, 12, 13, 14, 14, 17, 21, 22, 24
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
J. W. P. Hirschfeld, Complete arcs, Discr. Math., 174 (1997), 177-184.
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.
G. Keri, Types of superregular matrices and the number of n-arcs and complete n-arcs in PG(r,q), Journal of Combinatorial Designs, Vol. 14 (2006), pp. 363-390.
|
|
EXAMPLE
|
m'(31)=22 because there are no complete n-arcs in PG(2,31) for 23<=n<=31
|
|
CROSSREFS
|
Cf. A000510.
Cf. A000961.
Sequence in context: A021861 A088684 A088683 this_sequence A083507 A019851 A021603
Adjacent sequences: A000506 A000507 A000508 this_sequence A000510 A000511 A000512
|
|
KEYWORD
|
nonn,hard,nice
|
|
AUTHOR
|
J. W. P. Hirschfeld [ jwph(AT)sussex.ac.uk ]
|
|
EXTENSIONS
|
Definition clarified by G. Keri (keri(AT)sztaki.hu), Jan 03 2008
|
|
|
Search completed in 0.002 seconds
|
