46442

Appears in sequences

• Number of (s(0), s(1), ..., s(n)) such that every s(i) is an integer, s(0) = 0, s(1) = 1, s(n) = 2, |s(i) - s(i-1)| <= 1 for i >= 2, |s(2) - s(1)| = 1, |s(3) - s(2)| = 1 if s(2) = 1. Also T(n,n-2), where T is the array in A026268.at n=11A026288
• Number of 3 X 3 0..n arrays with row and column sums one greater than the previous row and column.at n=9A202865
• Number of n X 2 0..2 arrays with horizontal differences mod 3 never 1, vertical differences mod 3 never -1, and rows and columns lexicographically nondecreasing.at n=31A229439
• Number of 2Xn arrays containing n copies of 0..2-1 avoiding the pattern down-up in every row and column.at n=10A269506
• Numbers whose prime factorization (prime factors and exponents) contains the digits 1 and 2 at least once, but no other digits.at n=36A364484