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 A241984 #16 Dec 11 2015 22:01:23 %S A241984 1,7,19,37,55,82,127,166,232,316,385,463,547,634,706,805,922,1036, %T A241984 1165,1294,1429,1597,1735,1888,2041,2203,2395,2596,2749,2911,3133, %U A241984 3337,3559,3772,4009,4261,4489,4723,4987,5242 %N A241984 The number of P-positions in the Cookie Monster game with at most three piles, allowing for piles of zero, that are born by generation n. %C A241984 In the Cookie Monster game, there are several piles of counters. A player is allowed to take the same positive number of counters from any nonempty subset of the piles. The player who cannot move loses. %H A241984 T. Khovanova and J. Xiong, <a href="http://arxiv.org/abs/1407.1533">Cookie Monster Plays Games</a>, arXiv:1407.1533 [math.HO], 2014. %e A241984 For n = 1 the a(1) = 7 P-positions are (0,0,0) and (0,1,2), and permutations. %Y A241984 Cf. A241983 (partial sums), A237686 (Nim), A241986 (At-Most-2-Jars Game), A241988 (Consecutive Game). %K A241984 nonn %O A241984 0,2 %A A241984 _Tanya Khovanova_ and _Joshua Xiong_, Aug 10 2014