31022

Appears in sequences

• INVERTi transform of central trinomial coefficients (A002426).at n=14A007971
• a(n) = Sum_{k=0..floor(n/2)} A027157(n-k, k).at n=17A027167
• Expansion of 1 - x - sqrt(1 - 2*x - 3*x^2) in powers of x.at n=14A126068
• Expansion of 2 - x - sqrt(1-2x-3x^2).at n=14A168055
• Number of (n+2)X(3+2) 0..3 arrays with no row, column, diagonal or antidiagonal in any 3X3 subblock summing to 0 2 4 5 7 or 9.at n=4A251647
• Number of (n+2)X(5+2) 0..3 arrays with no row, column, diagonal or antidiagonal in any 3X3 subblock summing to 0 2 4 5 7 or 9.at n=2A251649
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with no row, column, diagonal or antidiagonal in any 3X3 subblock summing to 0 2 4 5 7 or 9.at n=23A251652
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with no row, column, diagonal or antidiagonal in any 3X3 subblock summing to 0 2 4 5 7 or 9.at n=25A251652
• "Inside numbers". Pick a term "t" and one of its digits "d". Now jump to the right over d digits if "d" is odd, and to the left over d digits if "d" is even. Whatever the "d" you choose, you will stay on "t".at n=32A284515
• Consider the graph with one central vertex connected to three outer vertices (a star graph). Then, a(n) is the minimum number of moves required to transfer a stack of n pegs from one outer vertex to another outer vertex, moving pegs to adjacent vertices, following the rules of the Towers of Hanoi.at n=44A291876