OFFSET
1,1
COMMENTS
Although a(16) is not known, a few later terms are known. For example a(17)=1.
J. H. Conway offered $1000 for the value (with proof) of a(16).
LINKS
Jared DeLeo, Uniform Shared Neighborhood Structures in Edge-Regular Graphs, arXiv:2409.00268 [math.CO], 2024. See p. 15.
Joshua Fallon, Kirsten Hogenson, Lauren Keough, Mario Lomelí, Marcus Schaefer, and Pablo Soberón, A Note on the Maximum Rectilinear Crossing Number of Spiders, arXiv:1808.00385 [math.CO], 2018.
Aleksandar Jurišić and Janoš Vidali, No strongly regular graph is locally Heawood, Chebyshevskii Sbornik (2020) Vol. 20, No. 2, 199-206.
OEIS50 DIMACS Conference on Challenges of Identifying Integer Sequences, Problem Session 2, Oct 10 2014, J. H. Conway, Five $1000 Problems (starting at about 06.44). This sequence is mentioned in the first problem.
Reimbay Reimbayev, The Lower Bound for Number of Hexagons in Strongly Regular Graphs with Parameters lambda = 1 and mu = 2, arXiv:2409.10620 [math.CO], 2024. See p. 12.
Tal Schuster, Ashwin Kalyan, Oleksandr Polozov, and Adam Tauman Kalai, Programming Puzzles, arXiv:2106.05784 [cs.LG], 2021.
Wikipedia, Sylver coinage
Sa’ar Zehavi and Ivo Fagundes David de Oliveira, Not Conway's 99-Graph Problem, research paper, Department of Computer Science, Technion, Sep 15 2017.
Doron Zeilberger, Videos of Talks Delivered in SLOANE75/OEIS50 DIMACS Conference on Challenges of Identifying Integer Sequences (see Problem Session 2, Oct 10 2014)
CROSSREFS
KEYWORD
nonn,more,hard
AUTHOR
N. J. A. Sloane, Oct 10 2014
STATUS
approved