1944810000

Appears in sequences

• a(n) = (10*n)^4.at n=21A017272
• a(n) = (11*n + 1)^4.at n=19A017404
• a(n) = (12*n + 6)^4.at n=17A017596
• a(n) = binomial(n+2, 2)^4.at n=19A059977
• Smallest number with exactly n^2 divisors.at n=24A061707
• Smallest number with exactly A025475(n) divisors.at n=22A065743
• Products of rows in A076099.at n=3A076097
• Triangular array: for s=0 to r-1, a(r,s) = p(s)^(r-s), where p(s) is the s-th primorial number. (p(0)=1, p(1)=2, p(2)=2*3, p(3)=2*3*5,...).at n=32A079474
• Duplicate of A076097.at n=3A081969
• Primorial numbers raised to the power of 2^n (where n is a nonnegative integer), sorted.at n=21A133492
• A symmetrical binomial product triangle sequence:q=4; t(n,m,q)=If[n == 0 || n == 1, 1, Product[Binomial[n + i, m + i], {i, -Floor[q/2], Floor[q/2]}] + Product[Binomial[n + i, n - m + i], {i, -Floor[q/2], Floor[q/2]}]].at n=40A174149
• a(n) = A002110(n)^n.at n=4A181555
• Members of A025487 whose prime signature is self-conjugate (as a partition).at n=31A181825
• Number of (n+2)X8 binary arrays avoiding patterns 001 and 011 in rows and columns.at n=9A202098
• a(n) = (n*(n+1))^4.at n=14A248619
• Number of (n+1)X(7+1) 0..1 arrays with nondecreasing sum of every two consecutive values in every row and column.at n=10A250431
• a(n) is the smallest number whose number of divisors is the n-th odd square.at n=12A300357
• Numbers with adjusted frequency depth 3 whose prime indices cover an initial interval of positive integers.at n=27A325374
• Numbers m that have recursively self-conjugate prime signatures.at n=10A330781
• a(n) = A108951(A346096(n)), where A346096(n) gives the numerator of the primorial deflation of A276086(A108951(n)).at n=19A346106