83665

Appears in sequences

• Pseudoprimes to both base 2 and base 3, i.e., intersection of A001567 and A005935.at n=19A052155
• Sarrus numbers n (A001567) which satisfy mu(n) = -1 and which are not Super-Poulet numbers (A050217).at n=29A074380
• Pseudotwinprimes p+2 for primes p such that p+2 divides p^(p+2)+2 and p+2 is composite.at n=26A100873
• Number of n-bit strings that contain no more than 4 zeros and no more than 2 leading and 2 trailing zeros.at n=16A102026
• Composite numbers k such that 2^k-2 and 3^k-3 are both divisible by k and k is not a Carmichael number (A002997).at n=5A153513
• Poulet numbers of the form (6k+1)*(24k+1).at n=1A182123
• 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=38A210993
• Fermat pseudoprimes to base 2 of the form m*n^2 + (11*m - 23)*n + 19*m - 49, where m, n >= 0.at n=30A215326
• Fermat pseudoprimes to base 2 with three prime factors.at n=29A215672
• Fermat pseudoprimes to base 2 divisible by 5.at n=15A216023
• Hilltop maps: number of n X 1 binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or vertical neighbor in a random 0..2 n X 1 array.at n=16A218199
• Fermat pseudoprimes to base 2 which are congruent to 1 (mod 8).at n=36A218483
• Fermat pseudoprimes to base 2 which are not Euler pseudoprimes to base 2.at n=30A227136
• Fermat pseudoprimes to base 2 that are decagonal.at n=10A321870
• Composite numbers k of the form 4u+1 for which the odd part of phi(k) divides k-1.at n=33A339870