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 A241985 #13 Oct 06 2014 23:02:16 %S A241985 1,7,13,13,25,37,37,43,37,43,55,49,73,79,79,109,97,115,85,97,97,145, %T A241985 121,109,163,151,151,115,121,181,175,211,193,193,211,169,211,271,187, %U A241985 181 %N A241985 The number of P-positions in the At-Most-2-Jars game with up to three piles, allowing for piles of zero, that are born in generation n. %C A241985 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. %C A241985 a(n) is always 1 greater than a multiple of 6. %H A241985 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 A241985 For n = 1 the a(1) = 7 P-positions are (1,1,1) and permutations of (0,1,2). %Y A241985 Cf. A241986 (first differences), A237711 (Nim), A241983 (Cookie Monster Game), A241987 (Consecutive Game). %K A241985 nonn %O A241985 0,2 %A A241985 _Tanya Khovanova_ and _Joshua Xiong_, Aug 10 2014