30536

Appears in sequences

• The minimal number which has multiplicative persistence 6 in base n.at n=2A064870
• Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=2, r=3, I={1,2}.at n=19A080003
• Alternating sum of Motzkin numbers A001006.at n=13A187306
• Number of n X 4 binary arrays without the pattern 0 1 diagonally or vertically.at n=23A188838
• Number of (n+1) X (3+1) 0..3 arrays with every 2 X 2 subblock having the sum of the absolute values of all six edge and diagonal differences equal to 9.at n=7A234135
• Number of (n+1) X (1+1) 0..3 arrays with each 2 X 2 subblock having the number of clockwise edge increases less than or equal to the number of counterclockwise edge increases.at n=2A234789
• Number of (n+1)X(3+1) 0..3 arrays with each 2X2 subblock having the number of clockwise edge increases less than or equal to the number of counterclockwise edge increases.at n=0A234791
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with each 2X2 subblock having the number of clockwise edge increases less than or equal to the number of counterclockwise edge increases.at n=3A234796
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with each 2X2 subblock having the number of clockwise edge increases less than or equal to the number of counterclockwise edge increases.at n=5A234796
• Number of nX7 0..1 arrays with every element equal to 0, 1, 2 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=5A302622
• Number of 6Xn 0..1 arrays with every element equal to 0, 1, 2 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=6A302627
• a(n) = Sum_{k=0..n} binomial(k+2,2) * binomial(k,n-k)^2.at n=9A377145