130159

Appears in sequences

• Triangle read by rows: T(n,k) (n>=1, 1 <= k <= n) = number of alternating anagrams on n letters (of length 2n) which are decomposable into at most k slices.at n=38A239894
• T(n,k)=Number of nXk 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 2, 3 or 4 neighboring 1s.at n=47A297762
• Number of 3 X n 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 2, 3 or 4 neighboring 1's.at n=7A297764