414720000
domain: N
Appears in sequences
- a(1) = 3 then a(n) = smallest multiple of a(n-1) > a(n-1) such that a(n) - 1 is a prime.at n=15A084717
- A062401(x)=phi[sigma(x)] function is iterated; initial value=2^n; a(n)=smallest term of trajectory.at n=29A097000
- Let k(n) = mod(3,n)-1. Then a(n) = 4*a(n-1) if n is odd, otherwise ((5+k(n))/4)*a(n-1), with a(0) = 1, a(1) = 2.at n=25A123761
- a(n) = n^4*(n+1)^4/8.at n=14A202107
- 4-full numbers (A036967) sandwiched between twin primes.at n=7A360841