107664

Appears in sequences

• The number of reachable states in a simple two-player counting game, in which each player starts with the pair (1,1) and one move is to add one of the opponent's numbers to one of your own numbers, but no number can grow above a pre-defined maximum n. The game continues until one of the players has no legal moves left. The winner is the one having the higher sum of his numbers.at n=29A161531
• 4-step Fibonacci sequence starting with 0, 1, 1, 1.at n=20A251655
• Number of length n arrays of permutations of 0..n-1 with each element moved by -3 to 3 places and every three consecutive elements having its maximum within 3 of its minimum.at n=26A263692
• Numbers k such that Bernoulli number B_{k} has denominator 46410.at n=29A295590