34945

Appears in sequences

• Euler pseudoprimes: composite numbers n such that 2^((n-1)/2) == +-1 (mod n).at n=26A006970
• Composite numbers k such that k == +-1 (mod 8) and 2^((k-1)/2) == 1 (mod k).at n=19A006971
• Euler-Jacobi pseudoprimes: 2^((n-1)/2) == (2 / n) mod n, where (2 / n) is a Jacobi symbol.at n=21A047713
• Numbers k such that sopf(k) + 1 = sopf(k+1), where sopf(k) = A008472(k).at n=28A064111
• Composite numbers k which divide A001045(k-1).at n=36A066488
• Sarrus numbers n (A001567) which satisfy mu(n) = -1 and which are not Super-Poulet numbers (A050217).at n=22A074380
• Sarrus numbers with more than 2 distinct prime factors.at n=25A080747
• a(n) = 49n^2 - 28n - 20.at n=26A118058
• Number of different strings of length n+4 obtained from "123...n" by iteratively duplicating any substring.at n=25A137741
• Odd composite numbers k for which k = A140607((k-1)/2).at n=7A140667
• a(n) = A007318 * [1, 6, 14, 9, 0, 0, 0, ...].at n=28A143690
• Sarrus numbers A001567 that are not Carmichael numbers A002997.at n=36A153508
• Nonprimes k such that 9*k divides 2^(k-1) - 1.at n=34A175521
• Pseudoprimes to base 2 of the form 4k+1.at n=39A178723
• Fermat pseudoprimes to base 2 of the form (6*k - 1)*((6*k - 2)*n + 1), where k and n are positive integers.at n=25A210993
• Fermat pseudoprimes to base 2 with three prime factors.at n=22A215672
• Fermat pseudoprimes to base 2 divisible by 5.at n=8A216023
• Fermat pseudoprimes to base 2 which are congruent to 1 (mod 8).at n=26A218483
• Sum of prime divisors of n (with repetition) is one less than the sum of prime divisors (with repetition) of n+1.at n=30A228126
• Numbers n such that (i) the sum of prime divisors of n (with repetition) is one less than the sum of prime divisors (with repetition) of n+1, and (ii) n and n+1 have the same number of prime divisors (with repetition).at n=12A237929