26451
domain: N
Appears in sequences
- Partial sums of A001935; at one time this was conjectured to agree with A007478.at n=38A014605
- a(n) = 50*n^2 + 1.at n=22A157916
- Number of increasing sequences of n integers x(1),...,x(n) with values in 1..5*n such that x(j) divides x(k) iff j divides k.at n=37A180382
- Number of permutations of 0..floor((n*8-1)/2) on even squares of an nX8 array such that each row, column, diagonal and (downwards) antidiagonal of even squares is increasing.at n=4A215786
- T(n,k)=Number of permutations of 0..floor((n*k-1)/2) on even squares of an nXk array such that each row, column, diagonal and (downwards) antidiagonal of even squares is increasing.at n=70A215788
- Number of permutations of 0..floor((5*n-1)/2) on even squares of an 5*n array such that each row, column, diagonal and (downwards) antidiagonal of even squares is increasing.at n=7A215791
- Number of permutations of 0..floor((n*8-2)/2) on odd squares of an nX8 array such that each row, column, diagonal and (downwards) antidiagonal of odd squares is increasing.at n=4A215868
- T(n,k) = Number of permutations of 0..floor((n*k-2)/2) on odd squares of an n X k array such that each row, column, diagonal and (downwards) antidiagonal of odd squares is increasing.at n=70A215870
- Number of permutations of 0..floor((5*n-2)/2) on odd squares of an 5Xn array such that each row, column, diagonal and (downwards) antidiagonal of odd squares is increasing.at n=7A215873
- Number of compositions of n into distinct parts such that the difference between adjacent parts is at least two.at n=32A328222