371280

Appears in sequences

• Number of (3,3; n,n)-partitions of a chain of length n^2 + n.at n=3A055663
• a(n) = n^5 - n.at n=13A061167
• Triangle of coefficients, read by rows, where T(n,k) is the coefficient of x^n*y^k in f(x,y) that satisfies f(x,y) = 1/(1-x) - x^2/(1-x)^3 + xy*f(x,y)^3.at n=51A086632
• Numbers that can be expressed as the difference of the squares of primes in exactly twelve distinct ways.at n=4A092008
• Numbers whose set of base 13 digits is {0,C}, where C base 13 = 12 base 10.at n=30A097259
• a(n) = binomial(n+3,3)*binomial(n+6,3).at n=12A105939
• Smallest number not yet used that is either a divisor or multiple of both n and a(n-1).at n=16A119862
• a(n) = prime(n)^5 - prime(n).at n=5A138404
• a(n) = A165641(n+1)/A165641(n).at n=47A165886
• Numbers with prime factorization pqrstu^4.at n=3A190388
• Numbers n such that the multiplicative group modulo n is the direct product of 7 cyclic groups.at n=21A272597
• a(n) = Pochhammer(n, 5) / 2.at n=13A293615
• Primitive 4-abundant numbers: Numbers k such that sigma(k) > 4k (A068404) all of whose proper divisors d are 4-deficient numbers (having sigma(d) < 4d).at n=28A307114
• a(n) = GCD({(2*n-k)*T(n,k)+(k+1)*T(n,k+1), k=0..n}), where T(n,k) stands for A214406 (the second-order Eulerian numbers of type B).at n=47A339100
• T(n, k) = (n + k - 1)*(n + k)*binomial(2*n + 1, n - k + 1) with T(0, 0) = T(1, 0) = 1. Triangle read by rows, T(n, k) for 0 <= k <= n.at n=41A342313
• Expansion of g.f. A(x) satisfying A(x) = 1 + x*(A(x)^5 + A(x)^9).at n=5A363305
• a(n) = n * Clausen(n, 1) / Clausen(n, 0).at n=48A363395
• 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=22A376374
• Primitive terms of A023198: numbers k with the property sigma(k)/k >= 4 that are not divisible by any other number with that property.at n=30A392936