%I A003411 M0561
%S A003411 1,2,3,4,6,8,11,15,21,29,40,55,76,105,145,200,276,381,526,726,1002,
%T A003411 1383,1909,2635,3637,5020,6929,9564,13201,18221,25150,34714,47915,66136
%N A003411 Losing initial positions in game: two players alternate in removing >
               = 1 stones; last player wins; first player may not remove all stones; 
               each move <= 3 times previous move.
%D A003411 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%H A003411 S. Plouffe, <a href="http://www.lacim.uqam.ca/%7Eplouffe/articles/MasterThesis.pdf">
               Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures</
               a>, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 
               1992.
%H A003411 S. Plouffe, <a href="http://www.lacim.uqam.ca/%7Eplouffe/articles/FonctionsGeneratrices.pdf">
               1031 Generating Functions and Conjectures</a>, Universit\'{e} du 
               Qu\'{e}bec \`{a} Montr\'{e}al, 1992.
%F A003411 a(n) = a(n-1) + a(n-4), n >= 5; G.f.: (1+x+x^2+x^3+x^4)/(1-x-x^4).
%p A003411 A003411:=-(1+z+z**2+z**3+z**4)/(-1+z+z**4); [Conjectured by S. Plouffe 
               in his 1992 dissertation.]
%Y A003411 Presumably equals A048590(n-3) - 3, n>3.
%Y A003411 Sequence in context: A006683 A014213 A064323 this_sequence A034081 A064660 
               A066806
%Y A003411 Adjacent sequences: A003408 A003409 A003410 this_sequence A003412 A003413 
               A003414
%K A003411 nonn,easy
%O A003411 0,2
%A A003411 N. J. A. Sloane (njas(AT)research.att.com), R. K. Guy, Rodney W. Topor 
               (rwt(AT)cit.gu.edu.au).