3732480

Appears in sequences

• Values of phi in arithmetic progression of at least 6 terms having the same value of phi in A050518.at n=23A050520
• Least number whose number of divisors is A007304(n) (the n-th number that is the product of 3 distinct primes).at n=11A061299
• Product of first n terms of A163085.at n=5A163086
• Smallest number having exactly t divisors, where t is the n-th triprime (A014612).at n=35A185445
• Numbers m for which Sum_{i=1..k} (1+1/p_i) + Product_{i=1..k} (1+1/p_i) is an integer, where p_i are the k prime factors of m (with multiplicity).at n=28A199767
• Prime factorization representation of polynomials defined recursively by p(0,x)=1 and for n>0: p(n,x) = x*p(n-1,x) + 4n+2. (See A192750).at n=2A265750
• Base-6 complementary numbers: n equals the product of the 6 complement (6-d) of its base-6 digits d.at n=22A298976
• a(0) = 1; for n > 0, a(n) = A000120(n) * a(n-A000120(n)), where A000120(n) is the binary weight of n.at n=48A320008
• Obverse convolution A000045**A000032; see Comments.at n=6A374865
• a(n) = a(n-1) * a(n-2) * (1 - 2 / (n * (n-1))), with a(1) = 2, a(2) = 3.at n=7A380023
• Number of possible configurations of an n dimensional Rubik's simplex.at n=0A381366