3568661

Appears in sequences

• Composite numbers k such that k divides Fibonacci(k+1) or Fibonacci(k-1) and 2^(k-1) == 1 (mod k).at n=31A214434
• a(n) is the smallest Fermat pseudoprime to base 2 such that gpf(p-1) = prime(n) for all prime factors p of a(n).at n=28A327789
• Numbers that are both Fermat pseudoprimes to base 2 (A001567) and Bruckman-Lucas pseudoprimes (A005845).at n=22A329240