20590

Appears in sequences

• Number of partitions in parts not of the form 21k, 21k+3 or 21k-3. Also number of partitions with at most 2 parts of size 1 and differences between parts at distance 9 are greater than 1.at n=41A035981
• Let M(n) be the n X n matrix m(i,j)=min(i,j) for 1<=i,j<=n then a(n) is the trace of M(n)^(-6).at n=23A114358
• Let M(n) = maximal value of (n/k)^k over all k = 1, 2, ...; a(n) = ceiling(M(n)).at n=26A139078
• a(n) = (7*n+2)*(7*n+5) = 49*n^2 + 49*n + 10.at n=20A177060
• Number of 2 X n 0..1 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.at n=13A279978