441000

Appears in sequences

• Number of sorted multiplicative partitions of n!.at n=20A085288
• Number of sorted multiplicative partitions of n!.at n=21A085288
• a(n) = (n+1)^2*(n+2)^3*(n+3)/24.at n=13A108648
• a(n) is the smallest number representable in exactly n ways as a sum of 2 powerful(1) numbers.at n=25A115354
• Numbers k such that reverse(k) is the number of divisors of k.at n=4A154541
• Ordered (2,2)-selections from the multiset {1,1,2,2,3,3,...,n,n}.at n=36A188667
• T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having index change +-(.,.) 0,0 0,2 or 1,1.at n=25A264110
• Number of (5+1)X(n+1) arrays of permutations of 0..n*6+5 with each element having index change +-(.,.) 0,0 0,2 or 1,1.at n=2A264115
• Exponential barely deficient numbers: exponential deficient numbers whose exponential abundancy is closer to 2 than that of any smaller exponential deficient number.at n=9A336253
• Number of ordered ways of writing the n-th n-gonal pyramidal number as a sum of n nonzero n-gonal pyramidal numbers.at n=10A336303
• Numbers having exactly four non-unitary prime factors.at n=20A338541
• Numbers k such that k | A328258(k).at n=7A348584
• Pointwise product of the arithmetic derivative and the primorial base exp-function.at n=52A358669
• Smallest powerful (1) number which is at the end of an arithmetic progression of n terms.at n=9A360883
• Expansion of e.g.f. A(x,y) satisfying A(x,y) = 1 + x*A(x,y) * exp(x*y * A(x,y)), as a triangle read by rows.at n=30A366230
• The number of positive n-digit integers whose digit product is n.at n=35A373641
• a(n) is the least exponential deficient number that has exactly n exponential abundant divisors.at n=11A389300