127110

Appears in sequences

• Number of walks of length n between two nodes at distance 4 in the cycle graph C_9.at n=16A095369
• Triangle, read by rows, T(n, k) = binomial(4*n, 3*k) + binomial(4*n, 3*(n-k)).at n=16A154918
• Triangle, read by rows, T(n, k) = binomial(4*n, 3*k) + binomial(4*n, 3*(n-k)).at n=19A154918
• Number of nX2 0..2 arrays with rows and columns lexicographically nondecreasing and the instance counts of every value within one of each other.at n=22A201426
• Expansion of 1/((1 - x)^9 - x^9).at n=12A306939
• Number of length-n ternary words having at most 5 palindromic subwords (including the empty word).at n=45A329023