OFFSET
5,2
COMMENTS
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 and a(4) =1. The formula for a(n) confirms these values. - Johannes W. Meijer, Aug 24 2013
REFERENCES
R. K. Guy, ``Anyone for Twopins?,'' in D. A. Klarner, editor, The Mathematical Gardner. Prindle, Weber and Schmidt, Boston, 1981, pp. 2-15.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
R. K. Guy, Anyone for Twopins?, in D. A. Klarner, editor, The Mathematical Gardner. Prindle, Weber and Schmidt, Boston, 1981, pp. 2-15. [Annotated scanned copy, with permission]
Index entries for linear recurrences with constant coefficients, signature (2,0,-2,1,2,-2,0,0,0,-1).
FORMULA
G.f.: (x^5*(1-x^2+x^3-2*x^5-x^6-x^7-x^8-x^9))/((1-x^2-x^5)*(1-2*x+x^2-x^5)). - Ralf Stephan, Apr 22 2004
a(n) = sum(A102541(n-k-1, 2*k), k=0..floor((n-1)/3)), n >= 5. - Johannes W. Meijer, Aug 24 2013
MATHEMATICA
LinearRecurrence[{2, 0, -2, 1, 2, -2, 0, 0, 0, -1}, {1, 2, 3, 5, 7, 10, 14, 20, 30, 45}, 40] (* Harvey P. Dale, Aug 26 2019 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
EXTENSIONS
More terms from Johannes W. Meijer, Aug 24 2013
STATUS
approved