341718
domain: N
Appears in sequences
- Number of length n words on alphabet {0,1} such that the length of every maximal block of 0's (runs) is the same.at n=26A243815
- Number of (n+1) X (1+1) 0..3 arrays with every 2 X 2 subblock summing to 4 5 6 7 or 8.at n=3A251492
- Number of (n+1)X(4+1) 0..3 arrays with every 2X2 subblock summing to 4 5 6 7 or 8.at n=0A251495
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock summing to 4 5 6 7 or 8.at n=6A251499
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock summing to 4 5 6 7 or 8.at n=9A251499