353430

Appears in sequences

• a(n) = n*(n+1)*(n+2)*(n+3)/4.at n=33A033487
• a(n) = smallest number which can be expressed as sum of d consecutive positive integers in exactly n ways (where d>0 is a divisor of the number).at n=37A082637
• Triangle, read by rows, where T(n,k) = C(n,k) * C(2^k*3^(n-k), n) for n>=k>=0.at n=12A136635
• Numbers k such that sigma(k) = phi(k)*(sum of the digits of k).at n=5A140173
• Numbers with prime factorization p*q*r*s*t*u^3 (where p, q, r, s, t, u are distinct primes).at n=17A190378
• Numbers k such that Euler phi(Dedekind psi(k)) > k.at n=28A196200
• Number of n X 3 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 0 1 1 vertically.at n=32A207363
• a(n) is the least number k > 0 such that sigma(k/n) = phi(k).at n=16A241762
• Numbers n such that n = concatenate(a, b) and sigma(a) + sigma(b) = phi(n).at n=19A249065
• First differences of (provable) Sierpiński numbers (A076336).at n=16A270971
• Triangle read by rows in which row(n) = {T(n, k)} is the lexicographically earliest list of n numbers such that adding 1 to some T(n, k) gives a row of numbers each divisible by prime(k).at n=26A286947
• Least k such that Sum_{i=0..n} (-k)^i / i! is a positive integer.at n=17A333074
• a(n) is the least number with exactly n odd divisors that are <= sqrt(n).at n=34A334853
• Numbers with a record number of deficient divisors.at n=37A335542
• a(0) = 1, and for n > 0, a(n) = a(n-1) * A019565(a(n-1)), where A019565 is the base-2 exp-function.at n=4A376408