36961

Appears in sequences

• Number of forests of trees on n labeled nodes.at n=7A001858
• Semiprimes in A054567.at n=30A113692
• Square array A(n,m), n>=0, m>=0, read by antidiagonals: A(n,m) = n-th number of the m-th iteration of the hyperbinomial transform on sequence A001858.at n=34A144304
• Square array A(n,m), n>=0, m>=0, read by antidiagonals: A(n,m) = n-th number of the m-th iteration of the hyperbinomial transform on sequence A001858.at n=35A144304
• a(n) = n^3 + (1-n)^2.at n=33A168297
• Number of lower triangular n X n arrays colored with integers 0 upwards introduced in row major order, with no element equal to any horizontal, vertical, diagonal or antidiagonal neighbor, and containing the value n(n+1)/2-2.at n=22A211911
• Number of 4 X n 0..1 arrays with rows and antidiagonals unimodal and columns nondecreasing.at n=10A224148
• Number of integer partitions of n whose run-sums are not weakly increasing.at n=40A357865
• Highly touchable numbers sandwiched between untouchable twin pairs.at n=3A370355
• Irregular triangular array read by rows. T(n,k) is the number of simple labeled graphs on [n] with circuit rank equal to k, n >= 1, 0 <= k <= binomial(n-1,2).at n=26A372153