66136

Appears in sequences

• 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.at n=33A003411
• Smallest losing position after your opponent has taken k stones in a variation of "Fibonacci Nim".at n=29A054736
• Expansion of (1 - x + x^2)/(1 - x - x^4).at n=37A103632
• a(n)=the sum of the (1,2)- and (1,3)-entries and twice the (1,4)-entry of the matrix P^n + T^n, where the 4 X 4 matrices P and T are defined by P=[0,1,0,0;0,0,1,0;0,0,0,1;1,0,0,0] and T=[0,1,0,0;0,0,1,0;0,0,0,1;1,0,0,1].at n=36A109526
• Expansion of 1/(1 - x - x^2 + x^3 - x^4 + x^6).at n=34A193146
• G.f. = b(2)*b(4)*b(6)/(x^9+x^8+x^7+x^6-x^5-x^4-x^3-x^2-x+1), where b(k) = (1-x^k)/(1-x).at n=15A266372
• Expansion of Product_{1 <= i_1 <= i_2 <= i_3 <= i_4} (1 + x^(i_1*i_2*i_3*i_4)).at n=47A321567