113201

Appears in sequences

• Composite numbers k such that k == +-1 (mod 8) and 2^((k-1)/2) == 1 (mod k).at n=31A006971
• Strong pseudoprimes to base 40.at n=35A020266
• a(n) = Fibonacci(n) - 2^(floor(n/2)).at n=26A028892
• Integers n such that n = A067030(j) for some j and A067286(j) < A067034(j).at n=23A068798
• Sarrus numbers n (A001567) which satisfy mu(n) = -1 and which are not Super-Poulet numbers (A050217).at n=34A074380
• Pseudoprimes to bases 2 and 5.at n=17A083732
• Cupolar numbers: a(n) = (n+1)*(5*n^2 + 7*n + 3)/3.at n=40A096000
• Fibonacci bisection minus powers of 2.at n=13A139209
• Fermat pseudoprimes to base 2 with three prime factors.at n=34A215672
• Composite numbers k == 1 (mod 4) such that (1 + i)^k == 1 + i (mod k), where i = sqrt(-1).at n=34A270698
• Plumb pseudoprimes: odd composites that pass Colin Plumb's extended Euler criterion test.at n=30A288153
• a(n) = a(n-1) + 3*a(n-2) -2*a(n-3) - 2*a(n-4), where a(0) = -1, a(1) = -1, a(2) = 0, a(3) = 1.at n=22A295731
• 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=34A375914
• Composite numbers k == 1, 9 (mod 10) such that 5^((k-1)/2) == 1 (mod k).at n=33A375915