2132531225

Appears in sequences

• Number of nX3 array permutations with every element making zero or one right-handed knight moves (out 2, right 1).at n=15A209538
• a(n) = Fibonacci(n)^2 * Fibonacci(n+1)^3.at n=10A363476