365740

Appears in sequences

• Number of (n+1)X(1+1) 0..3 arrays with no element equal to all horizontal neighbors or equal to all vertical neighbors, and new values 0..3 introduced in row major order.at n=5A238510
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with no element equal to all horizontal neighbors or equal to all vertical neighbors, and new values 0..3 introduced in row major order.at n=15A238515
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with no element equal to all horizontal neighbors or equal to all vertical neighbors, and new values 0..3 introduced in row major order.at n=20A238515
• Least k starting a chain of (2n+1) consecutive integers {h(k+i)}, i=0,1,...,2n, where h(k) is the length of the finite set {k, f(k), f(f(k)), ..., 1} in the Collatz (or 3x + 1) problem, with the property that h(k) = h(k+2n), h(k+1) = h(k+2n-1), ..., h(k+n-1) = h(k+n+1).at n=14A268486