The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A263454 Number of starting positions of misère Kayles with n pieces such that the 2nd player can win (P-positions). 1
 1, 0, 1, 2, 1, 5, 1, 6, 10, 8, 13, 18, 20, 34, 27, 48, 55, 76, 76, 113, 132, 173, 193, 253, 296, 394, 440, 558, 657, 860, 943, 1212, 1410, 1755, 2070 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 LINKS Wikipedia, Kayles EXAMPLE For n = 6 the a(6) = 5 P-positions are (5,1), (4,1,1), (3,3), (3,2,1), and (2,2,1,1). CROSSREFS Cf. A048833, A263453. Sequence in context: A014650 A014648 A260147 * A036073 A124227 A064865 Adjacent sequences:  A263451 A263452 A263453 * A263455 A263456 A263457 KEYWORD nonn,more AUTHOR Brian Hopkins, Oct 18 2015 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.

Last modified November 30 03:03 EST 2021. Contains 349416 sequences. (Running on oeis4.)