186961

Appears in sequences

• a(n) = 2*a(n-1) + 9*a(n-2), with a(0)=a(1)=1.at n=9A002535
• Expansion of e.g.f. sec(sin(arctan(x))) = 1/cos(x/sqrt(1+x^2)) (even powers only).at n=5A012028
• Composite numbers k such that k divides F(k-1) where F(j) are the Fibonacci numbers.at n=37A069106
• Nonprimes n such that Mod(n,4) == 1 and denominator(Fibonacci((n-1)/4)/n) = 1.at n=11A091982
• Composite k such that Fibonacci(k) == Legendre(k,5) == 1 (mod k).at n=29A093372
• Composite n such that n divides both Fibonacci(n-1) and Fibonacci(n) - 1.at n=18A094401
• Lucas pseudoprimes whose reversal is prime.at n=4A164824
• Frobenius pseudoprimes with respect to Fibonacci polynomial x^2 - x - 1.at n=23A212424
• Frobenius pseudoprimes == 1,4 (mod 5) with respect to Fibonacci polynomial x^2 - x - 1.at n=16A319168
• 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=28A337625