34714

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=31A003411
• Numbers k such that k | 13^k + 1.at n=33A015963
• Smallest losing position after your opponent has taken k stones in a variation of "Fibonacci Nim".at n=27A054736
• Expansion of (1 - x + x^2)/(1 - x - x^4).at n=35A103632
• Sum of the odd parts in all partitions of n into distinct parts.at n=43A116682
• Expansion of 1/(1 - x - x^2 + x^3 - x^4 + x^6).at n=32A193146
• Number of nX2 arrays of occupancy after each element stays put or moves to some king-move neighbor, without move-in move-out straight through or left turns.at n=4A221922
• T(n,k)=Number of nXk arrays of occupancy after each element stays put or moves to some king-move neighbor, without move-in move-out straight through or left turns.at n=16A221925
• T(n,k)=Number of nXk arrays of occupancy after each element stays put or moves to some king-move neighbor, without move-in move-out straight through or left turns.at n=19A221925
• Logarithmic derivative of A005169, the number of fountains of n coins.at n=18A227620
• a(n) = Sum_{k=0..n} 2^k * binomial(3*n,k) * binomial(3*n-k-1,n-k).at n=4A385320