143640

Appears in sequences

• Unitary harmonic numbers (those for which the unitary harmonic mean is an integer).at n=26A006086
• Numbers k such that sigma(k) >= 4*k.at n=23A023198
• Products of 4 consecutive integers: a(n) = n*(n-1)*(n-2)*(n-3).at n=21A052762
• a(n) = n*(n-1)*(n-2)*(n-3) for n>=5.at n=21A052768
• Smallest number whose set of divisors contains each digit 0-9 at least n times.at n=25A059436
• a(n) = n*(n+1)*(n^2 + n + 4)/4.at n=27A061316
• Numbers k such that sigma(k) > 4*k.at n=21A068404
• Least number which is the sum of four nonnegative cubes (not necessarily distinct and including zero) in n ways.at n=15A076749
• 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=11.at n=25A135196
• Number of walks of length 2*n+3 from origin to (1,1,1) on a cubic lattice.at n=3A135395
• Numbers with prime factorization pqrs^3t^3.at n=3A190385
• E.g.f. exp(exp(1/2*x^2+1/6*x^3)-1).at n=10A191424
• Numbers n whose divisors can be partitioned into four disjoint sets whose sums are all sigma(n)/4.at n=22A204831
• Numbers with abundancy 4 <= sigma(n)/n < 5.at n=23A230608
• Triangular array read by rows: row n gives the coefficients of the polynomial p(n,x) defined in Comments.at n=58A249100
• Numbers n for which there exists k > n such that A000203(k) = A000203(n) and A007947(k) = A007947(n), where A000203 gives the sum of divisors, and A007947 gives the squarefree kernel of n.at n=27A255334
• Least number, m, such that m^2 is expressible in just n ways as (p+1)(q+1) where p and q are distinct primes.at n=49A274877
• Highly composite numbers of class 5 (see comment in A275239).at n=27A275243
• Numbers n having a proper divisor d such that sigma(n) - k*d = k*n. Case k = 4.at n=11A291458
• Triangle read by rows: T(n,k) (n >= 1, 4 <= k <= n+3) is the number of k-sequences of balls colored with at most n colors such that exactly four balls are the same color as some other ball in the sequence.at n=38A292999