206158430209
domain: N
Appears in sequences
- Primes of the form 3*2^k + 1.at n=8A039687
- Primes p such that cototient(totient(p)) = A070556(p) is a power of 2.at n=28A070806
- Primes that divide Fibonacci number F(2^k) for some k.at n=19A074714
- Smallest prime which is 1 more than the product of n (not necessarily distinct) composite numbers.at n=18A081546
- a(n) = 3*4^n + 1.at n=18A140660
- a(n) = 3*8^n + 1.at n=12A199494
- Half the number of (n+1) X 3 0..2 arrays with every 2 X 2 subblock having exactly two distinct clockwise edge differences.at n=23A209530
- Half the number of (n+1) X 5 0..2 arrays with every 2 X 2 subblock having exactly two distinct clockwise edge differences.at n=13A209531
- Primes p that give record exponents of 2 in p^2 - 1 (A091282).at n=23A233930
- Odd prime factors of generalized Fermat numbers of the form 3^(2^m) + 1 with m >= 0.at n=23A273945
- Odd prime factors of generalized Fermat numbers of the form 7^(2^m) + 1 with m >= 0.at n=24A273948
- Odd prime factors of generalized Fermat numbers of the form 11^(2^m) + 1 with m >= 0.at n=23A273949
- Prime factors of numbers of the form 4^(2^m) - 2^(2^m) + 1 with m >= 0.at n=20A275528
- Sorted list of prime factors of numbers of the form 5^(2^m) + 2^(2^m) with m >= 0.at n=26A294133
- 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=17A334092
- Primes of the form q*2^h + 1, where q is a Mersenne prime.at n=23A336117
- a(n) is the smallest prime p such that p - 1 has 2*n divisors.at n=36A340870
- Primes p such that the odd part of p - 1 is upper-bounded by the dyadic valuation of p - 1.at n=29A361180
- Primes p such that valuation(p-1,2) is a record.at n=22A370606