53769

Appears in sequences

• Number of 0..n arrays of length 5 with 0 never adjacent to n.at n=7A212838
• Number of length 6+2 0..n arrays with every three consecutive terms having the sum of some two elements equal to twice the third.at n=25A248439
• Number of (n+1) X (1+1) 0..2 arrays with every 2 X 2 subblock summing to 1 2 3 4 5 6 or 7.at n=3A251366
• Number of (n+1)X(4+1) 0..2 arrays with every 2X2 subblock summing to 1 2 3 4 5 6 or 7.at n=0A251369
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock summing to 1 2 3 4 5 6 or 7.at n=6A251373
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock summing to 1 2 3 4 5 6 or 7.at n=9A251373
• Numbers of n-length words on alphabet {0,1,...,8} with no subwords ii, for i from {0,1}.at n=5A254598
• Number of non-abelian groups of order prime(n)^6.at n=30A271811
• Number of minimal edge covers in the n-prism graph.at n=10A290700
• Triangle read by rows, T(n, k) = 2^(n - k)*M(n, k, 1/2, 1/2), where M(n, k, x, y) is a generalized Motzkin recurrence. T(n, k) for 0 <= k <= n.at n=46A344557