132600

Appears in sequences

• a(n) = (2^n/n!) * Product_{k=0..n-1} (4*k + 1).at n=7A004981
• Left diagonal of partition triangle A047812.at n=22A007044
• a(n) = (2*n+2)*(2*n+3)*(2*n+4) = 24*A000330(n+1).at n=24A069074
• a(n) = (3*n-1) * 3*n * (3*n+1).at n=16A097321
• Product of all composite numbers k such that n<k<prime(r) where prime(r-1)<=n, or 1 if this set of k is empty.at n=48A109915
• Array of T(n,m)=1*5*...*(4n-3)*3*7*...*(4m-1)*2^(n+m)/(n+m)! by antidiagonals.at n=28A122882
• Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=12.at n=30A135197
• Smallest number having exactly n divisors that are contained in its decimal representation.at n=12A155005
• Number of arrays of 4 0..n integers with no sum of consecutive elements equal to a disjoint adjacent sum of an equal number of elements.at n=18A215191
• Positive integers that have a record number of divisors in Gaussian integers.at n=40A279254
• E.g.f.: exp(Sum_{k>=1} (k-1)^3*x^k).at n=6A290690
• G.f.: Product_{j>=1} (1 + p(x^j)), where p(x) is the g.f. of A000040.at n=23A309950
• Numbers k that are unitary harmonic in Gaussian integers: k * A332476(k) is divisible by A332472(k) + i*A332473(k) (where i is the imaginary unit).at n=19A332477
• Numbers k such that k*A001414(k)+1 is the square of a prime.at n=45A343141
• Expansion of e.g.f. (1 - x)^(-x^3/6).at n=10A351493
• Expansion of e.g.f. -log(1 + x^3/6 * log(1 - x)).at n=10A368166