52272

Appears in sequences

• Patterns in a dual ring.at n=17A007574
• a(n) = n^3 * Product_{p|n, p prime} (1 + 1/p).at n=32A033196
• Product of product of divisors of n and sum of divisors of n.at n=32A076722
• Partial sums of n 3-spaced triangular numbers beginning with t(3), e.g., a(2) = t(3)+t(6) = 6+21 = 27.at n=31A085788
• Non-perfect powers k for which q = A051903(k)/A051904(k) is an integer, A051904(k) > 1.at n=9A093770
• Triangle, read by rows, of Stirling numbers of first kind, S1(n,k), multiplied by k^k, for n >= 1, 1<=k<=n.at n=29A105196
• Column 5 of triangle A123610.at n=7A123615
• a(n) = A123610(2*n+2,n).at n=5A123618
• Triangle read by rows: T(n,k) = S1(n,k)*2^k, where S1(n,k) is an unsigned Stirling number of the first kind (cf. A008275) (n >= 1, 1 <= k <= n).at n=29A125553
• Coefficients of generalized factorial polynomials p(x, n) = (x/a - (n-1))*p(x, n-1) with p(x, 0) = 1, p(x, 1) = x/a and a = 1/2. Triangle read by rows, for n >= 0 and 0 <= k <= n.at n=38A137312
• Coefficients of raising factorial polynomials, T(n,k) = [x^k] p(x, n) where p(x, n) = (m*x + n - 1)*p(x, n - 1) with p[x, 0] = 1, p[x, -1] = 0, p[x, 1] = m*x and m = 2. Triangle read by rows, for n >= 0 and 0 <= k <= n.at n=38A137320
• Numbers with prime factorization p^2*q^3*r^4 where p, q, and r are distinct primes.at n=8A190115
• Achilles number whose largest proper divisor is also an Achilles number.at n=30A203662
• Number of partitions of 5n into exactly 4 parts.at n=39A256327
• Number of n X 2 0..2 arrays with every repeated value in every row and column one larger mod 3 than the previous repeated value, and upper left element zero.at n=5A267947
• Number of nX6 0..2 arrays with every repeated value in every row and column one larger mod 3 than the previous repeated value, and upper left element zero.at n=1A267951
• T(n,k)=Number of nXk 0..2 arrays with every repeated value in every row and column one larger mod 3 than the previous repeated value, and upper left element zero.at n=22A267952
• T(n,k)=Number of nXk 0..2 arrays with every repeated value in every row and column one larger mod 3 than the previous repeated value, and upper left element zero.at n=26A267952
• T(n,k)=Number of nXk 0..2 arrays with every repeated value in every row not one larger and in every column one larger mod 3 than the previous repeated value, and upper left element zero.at n=26A268092
• Number of 6Xn 0..2 arrays with every repeated value in every row not one larger and in every column one larger mod 3 than the previous repeated value, and upper left element zero.at n=1A268098