163081

Appears in sequences

• Strong pseudoprimes to base 30.at n=35A020256
• Composite numbers k such that k divides F(k-1) where F(j) are the Fibonacci numbers.at n=35A069106
• Nonprimes n such that Mod(n,4) == 1 and denominator(Fibonacci((n-1)/4)/n) = 1.at n=10A091982
• Composite k such that Fibonacci(k) == Legendre(k,5) == 1 (mod k).at n=27A093372
• Composite n such that n divides both Fibonacci(n-1) and Fibonacci(n) - 1.at n=16A094401
• Lucas pseudoprimes whose reversal is prime.at n=3A164824
• Triangle read by rows: T(n,k) = A022168(n,k)*n!/binomial(n,k) + 1 - n!.at n=22A176419
• Triangle read by rows: T(n,k) = A022168(n,k)*n!/binomial(n,k) + 1 - n!.at n=26A176419
• Frobenius pseudoprimes with respect to Fibonacci polynomial x^2 - x - 1.at n=22A212424
• Frobenius pseudoprimes == 1,4 (mod 5) with respect to Fibonacci polynomial x^2 - x - 1.at n=15A319168
• Odd composite integers m such that F(m)^2 == 1 (mod m) and L(m) == 1 (mod m), where F(m) and L(m) are the m-th Fibonacci and Lucas numbers, respectively.at n=26A337625