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 A005691 M0643 #22 Nov 10 2017 14:10:26
%S A005691 1,2,3,5,7,10,13,18,24,35,50,75,109,161,231,336,482,703,1020,1498,
%T A005691 2188,3214,4694,6877,10039,14699,21487,31489,46097,67582,98977,145071,
%U A005691 212463,311344,456045,668328,979182,1435107,2102900,3082037,4516347,6618985,9699527,14215176
%N A005691 Number of Twopins positions.
%C A005691 The complete sequence by _R. K. Guy_ in "Anyone for Twopins?" starts with a(0) = 0, a(1) = 1, a(2) = 1, a(3) = 1, a(4) = 1 and a(5) = 1. The formula for a(n) confirms these values. - _Johannes W. Meijer_, Aug 26 2013
%D A005691 R. K. Guy, ``Anyone for Twopins?,'' in D. A. Klarner, editor, The Mathematical Gardner. Prindle, Weber and Schmidt, Boston, 1981, pp. 2-15.
%D A005691 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A005691 Vincenzo Librandi, <a href="/A005691/b005691.txt">Table of n, a(n) for n = 6..1000</a>
%H A005691 R. K. Guy, <a href="/A005251/a005251_1.pdf">Anyone for Twopins?</a>, in D. A. Klarner, editor, The Mathematical Gardner. Prindle, Weber and Schmidt, Boston, 1981, pp. 2-15. [Annotated scanned copy, with permission]
%F A005691 G.f.: (x^6*(1-x^2+x^3-2*x^6-x^7-x^8-x^9-x^10-x^11))/((x^3-x+1)*(x^3+x-1)*(x^6+x^2-1)). - _Ralf Stephan_, Apr 22 2004
%F A005691 a(n) = Sum_{k=0..floor((n-1)/2)} A228570(n-1, 2*k), n >= 6. - _Johannes W. Meijer_, Aug 26 2013
%t A005691 CoefficientList[Series[((1 - x^2 + x^3 - 2*x^6 - x^7 - x^8 - x^9 - x^10 - x^11))/((x^3 - x + 1) (x^3 + x - 1) (x^6 + x^2 - 1)), {x, 0, 50}], x] (* _Wesley Ivan Hurt_, May 03 2017 *)
%Y A005691 Cf. A228570.
%K A005691 nonn
%O A005691 6,2
%A A005691 _N. J. A. Sloane_
%E A005691 Extended by _Johannes W. Meijer_, Aug 26 2013