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 A003413 M0521 #37 Apr 13 2022 13:25:16
%S A003413 1,2,3,4,5,7,9,12,15,19,24,31,40,52,67,86,110,141,181,233,300,386,496,
%T A003413 637,818,1051,1351,1737,2233,2870,3688,4739,6090,7827,10060,12930,
%U A003413 16618,21357,27447,35274,45334,58264,74882,96239,123686,158960,204294,262558
%N A003413 From a nim-like game.
%D A003413 R. K. Guy, personal communication.
%D A003413 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A003413 Vincenzo Librandi, <a href="/A003413/b003413.txt">Table of n, a(n) for n = 0..1000</a>
%H A003413 R. K. Guy, <a href="/A003410/a003410.pdf">Letter to N. J. A. Sloane, Apr 1975</a>
%H A003413 Simon Plouffe, <a href="https://arxiv.org/abs/0911.4975">Approximations de séries génératrices et quelques conjectures</a>, Dissertation, Université du Québec à Montréal, 1992; arXiv:0911.4975 [math.NT], 2009.
%H A003413 Simon Plouffe, <a href="/A000051/a000051_2.pdf">1031 Generating Functions</a>, Appendix to Thesis, Montreal, 1992
%H A003413 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (1, 0, 0, 0, 0, 1).
%F A003413 Recurrence: a(n) = a(n-1) + a(n-6) for n >= 8.
%F A003413 O.g.f.: -(x^2+x+1)*(x^5+x^3+1)/(-1+x+x^6) = -x-1+(-2-x-x^3-x^4-2*x^5)/(-1+x+x^6). - _R. J. Mathar_, Dec 05 2007
%p A003413 A003413:=-(z**5+z**3+1)*(z**2+z+1)/(z**6+z-1); # _Simon Plouffe_ in his 1992 dissertation
%t A003413 Join[{1, 2}, LinearRecurrence[{1, 0, 0, 0, 0, 1}, {3, 4, 5, 7, 9, 12}, 80]] (* _Vladimir Joseph Stephan Orlovsky_, Feb 11 2012 *)
%Y A003413 Cf. A005708.
%K A003413 nonn
%O A003413 0,2
%A A003413 _N. J. A. Sloane_