51618

Appears in sequences

• Josephus problem: numbers m such that, when m people are arranged on a circle and numbered 1 through m, the final survivor when we remove every 4th person is one of the first three people.at n=32A005427
• Number of states in minimal automaton that recognizes biquanimous numbers in base n.at n=16A065023
• a(1) = 1 and a(n) = ceiling((Sum_{k=1..n-1} a(k))/3) for n >= 2.at n=40A072493
• Number of ways to place 6 nonattacking grasshoppers on an n x n chessboard.at n=4A190579
• Poincaré series for invariant polynomial functions on the space of binary forms of degree 11.at n=18A293936