This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A052492 #6 Sep 03 2023 15:01:54 %S A052492 2,3,4,5,6,9,10,15,16,24,25,38,39,59,60,90,91,137,138,207,208,312,313, %T A052492 470,471,707,708,1062,1063,1595,1596,2394,2395,3593,3594,5391,5392, %U A052492 8088,8089,12134,12135,18203,18204,27306,27307 %N A052492 Initial pile sizes that guarantee a win for player 2 in a variant of Fibonacci Nim where the players may not take one stone. %H A052492 Tal Kubo, <a href="http://www.ics.uci.edu/~eppstein/cgt/fibnim.html">Generalized Fibonacci Nim</a>. %e A052492 a(5)=6 because player 1 can't take 1 stone; if player 1 takes 2 stones or more, player 2 grabs the rest. %Y A052492 Cf. A016741. %K A052492 nonn %O A052492 1,1 %A A052492 Felix Goldberg (sgefelix(AT)t2.technion.ac.il), Mar 16 2000