1658880

Appears in sequences

• Ratios of successive terms are 1,2,2,2,3,4,4,4,5,6,6,6,7,...at n=12A004528
• a(0) = 1; for n > 0, a(n) = (prime(n)-1)*a(n-1).at n=8A005867
• a(0) = 1; thereafter a(n) = n*a(n-1)^2.at n=5A052129
• Least number whose number of divisors is A007304(n) (the n-th number that is the product of 3 distinct primes).at n=9A061299
• Numbers k such that k = phi(sigma(phi(sigma(k)))).at n=27A067883
• Number of strings of length n over Z_6 with trace 0 and subtrace 2.at n=9A073973
• Number of strings of length n over Z_6 with trace 0 and subtrace 5.at n=9A073976
• Number of strings of length n over Z_6 with trace 2 and subtrace 2.at n=9A073985
• Number of strings of length n over Z_6 with trace 2 and subtrace 5.at n=9A073988
• GCD of sigma(p#) and phi(p#) where p# = A002110(n) is the product of the first n primes.at n=7A078558
• Multiplicative Pascal triangle, read by rows: T(n,1)=T(n,n)=n and T(n,k) = T(n-1,k-1) * T(n-1,k).at n=23A080046
• Multiplicative Pascal triangle, read by rows: T(n,1)=T(n,n)=n and T(n,k) = T(n-1,k-1) * T(n-1,k).at n=25A080046
• 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=36A096294
• Duplicate of A061299.at n=9A096933
• A062401(x)=phi[sigma(x)] function is iterated; initial value=2^n; a(n)=smallest term of trajectory.at n=20A097000
• a(n) = phi(binomial(2*n,n)*n).at n=11A131928
• Triangle T(n,i) whose n-th row gives the number of numbers in any prime(n)# consecutive numbers whose smallest prime factor is prime(n-i+1).at n=36A174909
• Numbers that set records for number of ordered factorizations as A025487(j)*A025487(k).at n=27A182763
• Smallest number having exactly t divisors, where t is the n-th triprime (A014612).at n=30A185445
• Sequence generated from A089080.at n=15A208147