201600

Appears in sequences

• Number of trees on n labeled vertices with degree at most 3.at n=7A003692
• Unary-binary rooted trees with n nodes.at n=8A029766
• Maximum of different products of partitions of n into distinct parts.at n=43A034893
• Number of labeled rooted trees with a degree constraint: ((3*n)!/(6^n)) * binomial(3*n + 1, n).at n=3A036771
• A triangle of numbers related to triangle A030524.at n=22A049352
• Triangle read by rows: T(n,k) = n!*k.at n=32A051683
• Number of pairs of sequences of cardinality at least 2.at n=8A052520
• a(n) = n! *((-1)^n + 2*n + 3)/4.at n=8A052558
• E.g.f. x^2*(1-x)/(1-x-x^2).at n=8A052602
• E.g.f. 1/(1-x-x^5).at n=8A052632
• Expansion of e.g.f. 5*x/(1-x).at n=8A052648
• Expansion of e.g.f. (1+x-x^2)/((1-x)*(1-x^2)).at n=8A052689
• Expansion of e.g.f. (1-x^4)/(1-x-x^4).at n=8A052692
• Number of degree-n even permutations of order exactly 6.at n=9A061133
• a(n) = floor(n!/sigma(n)).at n=9A062359
• a(1) = 3 = 1*3; a(n) = smallest multiple of a(n-1) which is of the form k(k+2).at n=5A068859
• Triangle of coefficients of Bateman polynomial n!Z_n(-x).at n=24A073768
• a(n) = n!*2^(n-1)/Product_{k=1..n} tau(k) where tau = A000005.at n=9A074740
• Matrix square of unsigned Lah triangle abs(A008297(n,k)) or A105278(n,k).at n=23A079621
• Hook products of all partitions of 12.at n=22A093791