94594500

Appears in sequences

• S2(j,2j+2) where S2(n,k) is a 2-associated Stirling number of the second kind.at n=6A000497
• Problem 66 in Knuth's Art of Computer Programming, vol. 4, section 7.2.1.5 asks which integer partition of n produces the most set partitions. The n-th term of this sequence is the number of set partitions produced by that integer partition.at n=15A102356
• Triangle of Ward numbers T(n,k) read by rows.at n=42A134991
• Triangle of Ward numbers T(n,k) (n>=0, k=0 if n=0, otherwise 0 <= k <= n-1) read by rows.at n=39A181996
• Triangle T(n,k) giving number of degree-2n permutations which decompose into exactly k cycles of even length, k=0..n.at n=33A204420
• Triangle read by rows, Ward numbers T(n, k) = Sum_{m=0..k} (-1)^(m + k) * binomial(n + k, n + m) * Stirling2(n + m, m), for n >= 0, 0 <= k <= n.at n=52A269939
• a(n) = Product_{d|n, d<n} A019565(d)^[0 == d mod 3].at n=83A319990
• T(n, k) = (m*n)!/(k!*(n-k)!)^m with m = 3; triangle read by rows, 0 <= k <= n.at n=16A320824
• T(n, k) = (m*n)!/(k!*(n-k)!)^m with m = 3; triangle read by rows, 0 <= k <= n.at n=19A320824
• Expansion of e.g.f. 1 / (1 + x * log(1 - x^4/24)).at n=15A375558
• Expansion of e.g.f. 1 / (1 - x * log(1 + x^4/24)).at n=15A375560