41041

Appears in sequences

• Carmichael numbers: composite numbers k such that a^(k-1) == 1 (mod k) for every a coprime to k.at n=10A002997
• Least Carmichael number with n prime factors, or 0 if no such number exists.at n=1A006931
• Euler pseudoprimes: composite numbers n such that 2^((n-1)/2) == +-1 (mod n).at n=27A006970
• Composite numbers k such that k == +-1 (mod 8) and 2^((k-1)/2) == 1 (mod k).at n=20A006971
• Expansion of g.f. 1/((1 - 3*x)*(1 - 4*x)*(1 - 12*x)).at n=4A017161
• Pseudoprimes to base 15.at n=38A020143
• Strong pseudoprimes to base 92.at n=33A020318
• Strong pseudoprimes to base 100.at n=35A020326
• 2nd elementary symmetric function of the first n+1 positive integers congruent to 2 mod 3.at n=12A024391
• Absolute Euler pseudoprimes: odd composite numbers n such that a^((n-1)/2) == +-1 (mod n) for every a coprime to n.at n=3A033181
• a(n) = (n^2-1)*(2*n^2-1).at n=12A033595
• Euler-Jacobi pseudoprimes: 2^((n-1)/2) == (2 / n) mod n, where (2 / n) is a Jacobi symbol.at n=22A047713
• Number of chiral pairs of dissectable polyhedra with n tetrahedral cells and symmetry of type G.at n=36A047758
• Duplicate of A047772.at n=9A047759
• Number of dissectable polyhedra with n tetrahedral cells and symmetry of type L.at n=17A047771
• Dissections: bisection of A047771.at n=8A047772
• Base-3 Euler-Jacobi pseudoprimes.at n=21A048950
• Pseudoprimes to both base 2 and base 3, i.e., intersection of A001567 and A005935.at n=12A052155
• Expansion of 1/(1 - 3*x^2 - x^3).at n=18A052931
• Terms of A050530 with four prime divisors.at n=31A053340