37431
domain: N
Appears in sequences
- a(n) = number of n-lettered words in the alphabet {1, 2, 3} with as many occurrences of the substring (consecutive subword) [1, 1, 1] as of [1, 2, 1].at n=10A211283
- Number of n X 4 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 1 neighboring 1.at n=6A296316
- Number of nX7 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 1 neighboring 1.at n=3A296319
- T(n,k)=Number of nXk 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 1 neighboring 1.at n=48A296320
- T(n,k)=Number of nXk 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 1 neighboring 1.at n=51A296320