852841

Appears in sequences

• Carmichael numbers with exactly 4 prime factors.at n=17A074379
• Pseudoprimes to bases 2,5 and 7.at n=21A083736
• Pseudoprimes to bases 2,3 and 7.at n=28A083738
• Pseudoprimes to bases 2, 3, 5 and 7.at n=18A083739
• Pseudoprimes to bases 3,5 and 7.at n=20A083740
• Product of first n primes that end in 1.at n=3A092609
• Carmichael numbers C such that C-1 is not a Niven/Harshad number.at n=8A097061
• Carmichael numbers with more than 3 prime factors.at n=18A141711
• Carmichael numbers divisible by 11.at n=6A182090
• Carmichael numbers divisible by 31.at n=6A182151
• Carmichael numbers of the form C = p*(2p-1)*(n*(2p-2)+p), where p and 2p-1 are prime numbers.at n=15A182207
• Carmichael numbers that have only prime divisors of the form 10k+1.at n=3A212843
• Composite numbers k such that k divides Fibonacci(k+1) or Fibonacci(k-1) and 2^(k-1) == 1 (mod k).at n=13A214434
• Carmichael numbers (A002997) that are not absolute Euler pseudoprimes (A033181).at n=26A262043
• Composite integers k satisfying 2^d == 2^(k/d) (mod k) for all d|k and that are not Super-Poulet (A050217).at n=11A291602
• Carmichael numbers k that satisfy 2^d == 2^(k/d) (mod k) for all d|k and are not Super-Poulet numbers (A050217).at n=1A291612
• Carmichael numbers k such that 2^d == 2^(k/d) (mod k) for all d|k.at n=2A291616
• Numbers that are both Fermat pseudoprimes to base 2 (A001567) and Bruckman-Lucas pseudoprimes (A005845).at n=8A329240
• a(n) is the smallest number with exactly n divisors such that all its divisors end with the same digit (which is necessarily 1).at n=15A338784
• Carmichael numbers k for which A053575(k) [the odd part of phi] does not divide k-1.at n=30A340092