65240
domain: N
Appears in sequences
- Number of partitions of n into parts not of the form 25k, 25k+6 or 25k-6. Also number of partitions with at most 5 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=45A036005
- Number of ways to place 3 nonattacking kings on an n X n board.at n=9A061996
- G.f. = { 1+sum(4*n*q^n, n=1..infinity)} / { theta series for square lattice }.at n=22A079902
- a(1) = 2, a(n) = a(n-1) + 3*(a(n-1)-floor(a(n-1)^(1/3))^3).at n=32A096295
- Triangle T(m,k) read by rows, where T(m,k) is the number of ways in which 1<=k<=m positions can be picked in an m X m square array such that all positions are mutually isolated. Two positions (s,t),(u,v) are considered as isolated from each other if min(abs(s-u),abs(t-v))>1.at n=38A098487
- Indices k such that 4 plus the k-th triangular number is a perfect square.at n=12A154139
- Number of partitions of n unlabeled objects of 7 colors.at n=6A270240
- Nonunitary weird numbers: numbers that are nonunitary abundant but not nonunitary pseudoperfect.at n=24A327948