90061

Appears in sequences

• a(n) = a(n-1) + a(n-5); a(0) = ... = a(4) = 1.at n=43A003520
• Bruckman-Lucas pseudoprimes: k | (L_k - 1), where k is composite and L_k = Lucas numbers A000032.at n=22A005845
• Expansion of 1/(1 -x^5 -x^6 -x^7 - ...).at n=48A017899
• Numbers k such that 189*2^k+1 is prime.at n=33A032471
• Composite n coprime to 5 such that Fibonacci(n) == Legendre(n,5) (mod n).at n=27A049062
• Composite numbers k such that k divides F(k-1) where F(j) are the Fibonacci numbers.at n=25A069106
• a(n) = A077706(n+1)/A077706(n).at n=20A077707
• Nonprimes n such that Mod(n,4) == 1 and denominator(Fibonacci((n-1)/4)/n) = 1.at n=7A091982
• Composite k such that Fibonacci(k) == Legendre(k,5) == 1 (mod k).at n=19A093372
• Odd composites m that divide Fibonacci(m)-1.at n=33A094394
• Composite n such that n divides both Fibonacci(n-1) and Fibonacci(n) - 1.at n=11A094401
• Sum C(n-4k,k-1), k=0..floor(n/5).at n=47A099562
• Semiprimes k that divide Fibonacci(k-1).at n=15A177086
• Frobenius pseudoprimes with respect to Fibonacci polynomial x^2 - x - 1.at n=13A212424
• Nonprime n not divisible by 2 or 3 such that Fibonacci(n-1) is congruent to (1 - Legendre(n,5))/2 modulo n.at n=32A220292
• Frobenius pseudoprimes == 1,4 (mod 5) with respect to Fibonacci polynomial x^2 - x - 1.at n=10A319168
• 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=16A337625
• Number of compositions of 5*n-2 into parts 1 and 5.at n=8A369837