30492

Appears in sequences

• Theta series of A_9 lattice.at n=5A008449
• a(n) = 3*(n+1)*binomial(n+2,6).at n=6A027779
• a(n) = 7*(n+1)*binomial(n+2,7)/2.at n=5A027780
• Number of nonempty subsets of {1,2,...,n} in which exactly 5/6 of the elements are <= (n+3)/3.at n=32A048092
• Number of rods required to make a 3-D cube of side length n.at n=21A059986
• Numbers k such that sigma (x) = k has exactly 12 solutions.at n=31A060676
• a(n) = 28*n^2.at n=33A064763
• Number of sorted multiplicative partitions of n!.at n=16A085288
• Number of sorted multiplicative partitions of n!.at n=17A085288
• Numbers k for which the quotient q(k)=(k+rev(k))/abs(k-rev(k)) is an integer.at n=16A087993
• Numbers that have exactly seven prime factors counted with multiplicity (A046308) whose digit reversal is different and also has 7 prime factors (with multiplicity).at n=22A109027
• Exponential abundant numbers: integers k for which A126164(k) > k, or equivalently for which A051377(k) > 2k.at n=31A129575
• Numbers which are the product of a non-palindrome and its reversal, where leading zeros are not allowed.at n=39A129623
• Averages of twin prime pairs k such that k*7 and k/7 are squares.at n=2A154673
• Triangle read by rows: T(n, m) = floor(binomial(n+1, m)* binomial(n+2, m)/(2*m+2)), 1 <= m <= n.at n=49A174102
• Triangle read by rows: T(n, m) = floor(binomial(n+1, m)* binomial(n+2, m)/(2*m+2)), 1 <= m <= n.at n=50A174102
• a(n) = lcm(n^2, swinging_factorial(n)).at n=11A181860
• Numbers with prime factorization pq^2r^2s^2.at n=16A189344
• Number of partitions of n containing at least one part m-3 if m is the largest part.at n=44A212543
• Expansion of x^4*(2-3*x-x^2)/((1+x)*(1-2*x)^2).at n=17A219751