56137
domain: N
Appears in sequences
- Number of n X n 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 4,0,2,1,3 for x=0,1,2,3,4.at n=4A196712
- Number of nX5 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 4,0,2,1,3 for x=0,1,2,3,4.at n=4A196715
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 4,0,2,1,3 for x=0,1,2,3,4.at n=40A196718
- Odd numbers which are factored to the same set of primes in Z as to the irreducible polynomials in GF(2)[X]; odd terms of A235036.at n=40A235039
- Number of (n+2)X(3+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000101 00010101 or 01010101.at n=6A260010
- Number of (n+2)X(7+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000101 00010101 or 01010101.at n=2A260014
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000101 00010101 or 01010101.at n=38A260015
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000101 00010101 or 01010101.at n=42A260015
- Numbers k such that A339549(k) = A339549(k+1).at n=30A339550
- a(n) = Sum_{k=0..4} 2^k * binomial(n,k).at n=18A389545