97921
domain: N
Appears in sequences
- Bruckman-Lucas pseudoprimes: k | (L_k - 1), where k is composite and L_k = Lucas numbers A000032.at n=24A005845
- Strong pseudoprimes to base 6.at n=29A020232
- Strong pseudoprimes to base 15.at n=16A020241
- Strong pseudoprimes to base 17.at n=32A020243
- Strong pseudoprimes to base 20.at n=28A020246
- Strong pseudoprimes to base 48.at n=36A020274
- Strong pseudoprimes to base 50.at n=26A020276
- Strong pseudoprimes to base 71.at n=27A020297
- Strong pseudoprimes to base 89.at n=33A020315
- Strong pseudoprimes to base 90.at n=26A020316
- Composite n coprime to 5 such that Fibonacci(n) == Legendre(n,5) (mod n).at n=30A049062
- Composite numbers k such that k divides F(k-1) where F(j) are the Fibonacci numbers.at n=27A069106
- Sequence arising from factorization of the Fibonacci numbers.at n=44A072183
- Nonprimes n such that Mod(n,4) == 1 and denominator(Fibonacci((n-1)/4)/n) = 1.at n=9A091982
- Composite k such that Fibonacci(k) == Legendre(k,5) == 1 (mod k).at n=21A093372
- Composite n such that n divides both Fibonacci(n-1) and Fibonacci(n) - 1.at n=13A094401
- Define k(n) to be the sequence of integers such that k(n)F(n)=F(2n)(Fibonacci sequence) (A000204); in turn define g(n) to be the sequence of integers such that g(n)k(n)=k(3n)(A110391); finally a(n) is the sequence of integers such that a(n)g(n)=g(5n).at n=2A157696
- Values of A110391(5n)/A110391(n).at n=3A159583
- Lucas pseudoprimes whose reversal is prime.at n=1A164824
- Semiprimes k that divide Fibonacci(k-1).at n=17A177086