62800
domain: N
Appears in sequences
- Numbers k for which phi(k) = phi(k+1) - phi(k-1).at n=27A076529
- a(n) = 1 + 2*n^2 + 3*n^3 + 4*n^4.at n=11A209262
- Number of (n+1) X (4+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5 (constant-stress 1 X 1 tilings).at n=8A235274
- Number of (n+1) X (9+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5 (constant-stress 1 X 1 tilings).at n=3A235279
- T(n,k)=Number of nXk arrays of permutations of 0..n*k-1 with rows nondecreasing modulo 2 and columns nondecreasing modulo 5.at n=22A264659
- Number of 2Xn arrays of permutations of 0..n*2-1 with rows nondecreasing modulo 2 and columns nondecreasing modulo 5.at n=5A264660
- Number of integer partitions of n whose median appears more times than any other part, i.e., partitions containing a unique mode equal to the median.at n=46A363740