943800
domain: N
Appears in sequences
- Number of nX1 0..1 arrays with the counts of all possible adjacent horizontal and vertical pair sum values being within one of each other.at n=25A203631
- Numbers m with m - 1, m + 1 and q(m) + 1 all prime, where q(.) is the strict partition function (A000009).at n=35A235344
- Triangle read by rows, Lah numbers of order 2, T(n,n) = 1, T(n,k) = 0 if k<0 or k>n, otherwise T(n,k) = T(n-1,k-1)+((n-1)^2+k^2)*T(n-1,k), for n>=0 and 0<=k<=n.at n=41A268434