|
|
A248380
|
|
a(n) = 1 if first player in Sylver coinage game can force a win by choosing n as the first number, otherwise a(n) = 2.
|
|
0
|
|
|
2, 2, 2, 2, 1, 2, 1, 2, 2, 2, 1, 2, 1, 2, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
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
|
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.
Tal Schuster, Ashwin Kalyan, Oleksandr Polozov, and Adam Tauman Kalai, Programming Puzzles, arXiv:2106.05784 [cs.LG], 2021.
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.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more,hard
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|