2702700

Appears in sequences

• Denominators of coefficients for numerical differentiation.at n=13A002548
• Duplicate of A002548.at n=13A093763
• 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=13A102356
• Triangle read by rows: see A128196 for definition.at n=38A126063
• Smallest number having exactly n triangular divisors.at n=30A130317
• Smallest k such that the partial sums of the divisors of k (in decreasing order) generate n primes.at n=22A187825
• Maximum number of binary strings of length 2n obtained from a partition of n.at n=14A247651
• a(n) = Product_{i=1..floor(n/2)} (2n-i)*(2n+i).at n=6A249056
• Triangle read by rows, coefficients of the polynomials P(m, n) = Sum_{k=1..n} binomial(m*n, m*k)* P(m, n-k)*z with P(m, 0) = 1 and m = 4.at n=13A278074
• Positions of records in A306440.at n=20A307221
• a(1) = 1; for n > 1, a(n) = Product_{d|n} A019565(d)^[moebius(d) = +1].at n=77A320017
• Ordered set partitions of the set {1, 2, ..., 4*n} with all block sizes divisible by 4, irregular triangle T(n, k) for n >= 0 and 0 <= k < A000041(n), read by rows.at n=10A327024
• Numbers that occur exactly 4 times in A036038, i.e., numbers m such that the multinomial coefficient (x_1 + ... + x_k)!/(x_1! * ... * x_k!) is equal to m for exactly 4 integer partitions (x_1, ..., x_k).at n=32A376374
• a(n) is the least number k that has exactly n divisors <= sqrt(k) of the form 4*j+3.at n=29A379683
• a(n) is the least number that is the area of a primitive Pythagorean triangle and is the sum of 2*n consecutive primes.at n=40A387673