2281701377

Appears in sequences

• Smallest number m such that the trajectory of m under iteration of Euler's totient function phi(n) [A000010] contains exactly n distinct numbers, including m and the fixed point.at n=32A007755
• Minimal 2^n safe-primes: a(n) = 2^n*A051886(n) + 1 (a prime number).at n=27A051900
• Smallest prime p such that n = A049108(p) = length of chain of iterates of Euler Phi starting with p.at n=31A060611
• Duplicate of A051900.at n=27A084706
• Prime factors of the odd terms of A007755.at n=19A092873
• Least prime of the form 1 + p*2^n, where p is an odd prime.at n=26A134854
• Smallest k such that phi(phi(k)) = 2^n, where phi is the Euler totient function.at n=29A184968
• Primes of the form 2^r * 17^s + 1.at n=13A291049
• Primes of the form 17*2^n + 1.at n=2A300407
• Primes p of the form of the form q*2^h + 1, where q is one of the Fermat primes; Primes p for which A329697(p) == 2.at n=15A334092
• Primes p such that the odd part of p - 1 is upper-bounded by the dyadic valuation of p - 1.at n=24A361180
• a(n) = 2^n*t + 1 where t is the least x such that there exists an r in the range 2 <= r <= x+1 that is coprime to 2^n*x + 1 and has multiplicative order 2^n modulo 2^n*x + 1.at n=26A370879