36495360

Appears in sequences

• a(0) = 1; for n > 0, a(n) = (prime(n)-1)*a(n-1).at n=9A005867
• a(n) = [n/1][n/2][n/3] ...[n/n] / n^(tau(n)/2).at n=33A076891
• Triangle T(n,k) read by rows: for n >=0 and n >= k >=0, the fraction of positive integers with exactly k of the first n primes as divisors is T(n,k)/A002110(n).at n=45A096294
• a(n) = phi(binomial(2*n,n)*n).at n=13A131928
• Least number phi(k) such that n * phi(k) < k, where phi is Euler's totient function.at n=5A355667
• a(n) = Sum_{k=0..floor(n/3)} (k+1) * 2^k * 3^(n-3*k) * binomial(k,4*(n-3*k)).at n=35A392075