3828001

Appears in sequences

• Absolute Euler pseudoprimes: odd composite numbers n such that a^((n-1)/2) == +-1 (mod n) for every a coprime to n.at n=28A033181
• Least pseudoprime to base 2 through base prime(n).at n=16A083876
• Least pseudoprime to base 2 through base prime(n).at n=17A083876
• Least pseudoprime to base 2 through base prime(n).at n=23A083876
• Least pseudoprime to base 2 through base prime(n).at n=15A083876
• Least pseudoprime to base 2 through base prime(n).at n=20A083876
• Least pseudoprime to base 2 through base prime(n).at n=21A083876
• Least pseudoprime to base 2 through base prime(n).at n=22A083876
• Least pseudoprime to base 2 through base prime(n).at n=18A083876
• Least pseudoprime to base 2 through base prime(n).at n=24A083876
• Least pseudoprime to base 2 through base prime(n).at n=19A083876
• Carmichael numbers C such that C-1 is not a Niven/Harshad number.at n=13A097061
• a(n) is the smallest Carmichael number (A002997) with the n-th prime as its smallest prime divisor, or 0 if no such number exists.at n=24A135720
• a(n) is the least Carmichael number of the form prime(n)*prime(n')*prime(n") with n < n' < n", or 0 if no such number exists.at n=25A141705
• Smallest product of three distinct primes of the form n*k+1.at n=24A193873
• Numbers that occur more than once in A193873, in order of appearance.at n=11A194263
• Carmichael numbers that have only prime divisors of the form 10k+1.at n=8A212843
• Carmichael numbers of the form (60k+41)*(90k+61)*(150k+101), where 60k+41, 90k+61 and 150k+101 are all primes.at n=1A255441
• Composite integers k satisfying 2^d == 2^(k/d) (mod k) for all d|k and that are not Super-Poulet (A050217).at n=20A291602
• 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=2A291612