55969

Appears in sequences

• Strong pseudoprimes to base 3.at n=15A020229
• Strong pseudoprimes to base 8.at n=27A020234
• Strong pseudoprimes to base 27.at n=37A020253
• Strong pseudoprimes to base 46.at n=33A020272
• Strong pseudoprimes to base 59.at n=35A020285
• Strong pseudoprimes to base 65.at n=26A020291
• Strong pseudoprimes to base 68.at n=35A020294
• Strong pseudoprimes to base 72.at n=24A020298
• [ (4th elementary symmetric function of P(n))/(2nd elementary symmetric function of P(n)) ], where P(n) = {1, p(1), p(2), ..., p(n-1)}, where p(0) = 1.at n=21A024535
• Denominator of fraction equal to the continued fraction [ 0, 2, 4, ...2n ].at n=6A036243
• Base-3 Euler-Jacobi pseudoprimes.at n=28A048950
• Bond percolation series for square lattice near a wall.at n=23A056532
• a(n) = gcd(2^n + 1, 3^n + 1).at n=71A066803
• Overpseudoprimes to base 3.at n=8A141350
• Number of n X n binary arrays symmetric under horizontal and vertical reflection with all ones connected only in a 1001-1001-1111 pattern in any orientation.at n=17A147407
• a(n) = gcd(k^n + 1, (k+1)^n + 1) for the smallest k at which the GCD exceeds 1.at n=70A186710
• Triangle read by rows: T(n,k) = K(n,1)*I(k,1) - (-1)^(n+k)*I(n,1)* K(k,1), where I(n,x) and K(n,x) are Bessel functions; 0<=k<=n.at n=28A246658
• Euler pseudoprimes to base 3: composite integers such that abs(3^((n - 1)/2)) == 1 mod n.at n=33A262051
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where A(n,k) is Sum_{j=0..floor(n/2)} ((n-j)!/j!)*binomial(n-j,j)*k^(n-2*j).at n=42A305401
• The "residue" pseudoprimes: odd composite numbers n such that q(n)^((n-1)/2) == 1 (mod n), where base q(n) is the smallest prime quadratic residue modulo n.at n=30A307798