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 A241986 #13 Oct 06 2014 23:02:23 %S A241986 1,8,21,34,59,96,133,176,213,256,311,360,433,512,591,700,797,912,997, %T A241986 1094,1191,1336,1457,1566,1729,1880,2031,2146,2267,2448,2623,2834, %U A241986 3027,3220,3431,3600,3811,4082,4269,4450 %N A241986 The number of P-positions in the At-Most-2-Jars game with at most three piles, allowing for piles of zero, that are born by generation n. %C A241986 In the At-Most-2-Jars game, there are several piles of counters. A player is allowed to take the same positive number of counters from any subset of two piles or any positive number of counters from one pile. The player who cannot move loses. %H A241986 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 A241986 For n = 1 the a(1) = 8 P-positions are (0,0,0), (1,1,1), and permutations of (0,1,2). %Y A241986 Cf. A241985 (partial sums), A237686 (Nim), A241984 (Cookie Monster Game), A241988 (Consecutive Game). %K A241986 nonn %O A241986 0,2 %A A241986 _Tanya Khovanova_ and _Joshua Xiong_, Aug 10 2014