49601
domain: N
Appears in sequences
- Strong pseudoprimes to base 11.at n=14A020237
- Strong pseudoprimes to base 35.at n=17A020261
- Strong pseudoprimes to base 88.at n=20A020314
- Smallest term x from A066669 such that phi(x) = 2^n times some prime.at n=13A066673
- a(n) = 31*n^2 + 1.at n=40A247155
- Least k such that phi(k) has exactly n prime factors (counted with multiplicity).at n=14A275969
- Composite numbers n such that 2^lpf(n) == 2 (mod n), where lpf(n) = A020639(n).at n=39A276733
- Semiprimes k = pq such that p^k == p (mod k) and q^k == q (mod k).at n=35A294169
- The sixth term of the greedy B_n set of natural numbers.at n=18A369818