29341

Appears in sequences

• Deceptive nonprimes: composite numbers k that divide the repunit R_{k-1}.at n=34A000864
• Strong pseudoprimes to base 2.at n=6A001262
• Fermat pseudoprimes to base 2, also called Sarrus numbers or Poulet numbers.at n=39A001567
• Carmichael numbers: composite numbers k such that a^(k-1) == 1 (mod k) for every a coprime to k.at n=9A002997
• Pseudoprimes to base 5.at n=37A005936
• Pseudoprimes to base 7.at n=35A005938
• Euler pseudoprimes: composite numbers n such that 2^((n-1)/2) == +-1 (mod n).at n=22A006970
• Pseudoprimes to base 15.at n=34A020143
• Pseudoprimes to base 90.at n=37A020218
• Strong pseudoprimes to base 4.at n=16A020230
• Strong pseudoprimes to base 6.at n=11A020232
• Strong pseudoprimes to base 8.at n=19A020234
• Strong pseudoprimes to base 9.at n=28A020235
• Strong pseudoprimes to base 18.at n=18A020244
• Strong pseudoprimes to base 24.at n=14A020250
• Strong pseudoprimes to base 31.at n=12A020257
• Strong pseudoprimes to base 32.at n=34A020258
• Strong pseudoprimes to base 36.at n=23A020262
• Strong pseudoprimes to base 50.at n=17A020276
• Strong pseudoprimes to base 54.at n=16A020280