108032

Appears in sequences

• Triangle read by rows: T(n,k) = Sum_{i <= n, j <= k, (i,j) <> (n,k)} T(i,j), starting with T(1,1) = 1, for n >= 1 and 1 <= k <= n.at n=33A192933
• Number of length-n 0..n arrays with no adjacent pair x,x+1 followed at any distance by x+1,x.at n=5A268450
• Number of length-n 0..6 arrays with no adjacent pair x,x+1 followed at any distance by x+1,x.at n=5A268455
• Number of length-6 0..n arrays with no adjacent pair x,x+1 followed at any distance by x+1,x.at n=5A268460