112141

Appears in sequences

• Strong pseudoprimes to base 3.at n=25A020229
• Strong pseudoprimes to base 5.at n=19A020231
• Strong pseudoprimes to base 15.at n=17A020241
• Strong pseudoprimes to base 45.at n=21A020271
• Strong pseudoprimes to base 71.at n=29A020297
• Pseudoprimes to bases 3 and 5.at n=15A083734
• Overpseudoprimes to base 3.at n=14A141350
• Strong pseudoprimes to bases 3 and 5.at n=0A215566
• Sum of first n Honaker primes.at n=38A276255
• Numbers with property that both the digit sum and the sum of the prime factors (counted with multiplicity) have only digits 0 and 1 in base 10.at n=29A297614
• a(n) = concatenation of all (i, e_i) with e_i > 0, when n = Product_{i >= 1} prime(i)^e_i.at n=41A299400
• Centered truncated octahedral numbers: the number of integer triples (x,y,z) such that max(|x|,|y|,|z|) <= 2n and |x|+|y|+|z| <= 3n.at n=15A371515
• Base-5 Euler-Jacobi pseudoprimes: odd composite k coprime to 5 such that 5^((k-1)/2) == (5/k) (mod n), where (5/k) is the Jacobi symbol (or Kronecker symbol).at n=33A375914
• Composite numbers k == 1, 9 (mod 10) such that 5^((k-1)/2) == 1 (mod k).at n=32A375915
• Composite numbers k == 1, 11 (mod 12) such that 3^((k-1)/2) == 1 (mod k).at n=30A375917