126848

Appears in sequences

• Number of (n+1) X (2+1) 0..3 arrays with the maximum plus the upper median plus the lower median minus the minimum of every 2 X 2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=2A237400
• Number of (n+1) X (3+1) 0..3 arrays with the maximum plus the upper median plus the lower median minus the minimum of every 2 X 2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=1A237401
• T(n,k) = number of (n+1) X (k+1) 0..3 arrays with the maximum plus the upper median plus the lower median minus the minimum of every 2 X 2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=7A237403
• T(n,k) = number of (n+1) X (k+1) 0..3 arrays with the maximum plus the upper median plus the lower median minus the minimum of every 2 X 2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=8A237403
• Numbers k such that phi(6k) is either phi(6k-2) or phi(6k+2), where phi is Euler's totient function A000010.at n=31A279011
• Numbers k such that phi(6k) = phi(6k+2), where phi is Euler's totient function A000010.at n=13A279184