75077

Appears in sequences

• Bruckman-Lucas pseudoprimes: k | (L_k - 1), where k is composite and L_k = Lucas numbers A000032.at n=20A005845
• Composite n coprime to 5 such that Fibonacci(n) == Legendre(n,5) (mod n).at n=24A049062
• a(n) = 4*prime(n)^2+1.at n=32A060429
• a(n) = A065824(A047845(n+1)).at n=32A065884
• Composite numbers k that divide Fibonacci(k+1).at n=24A069107
• a(0) = 5, a(1) = 7; for n>1, a(n) = a(n-1)+a(n-2)-(2n-2).at n=24A089061
• Composite n such that Fibonacci(n) == Legendre(n,5) == -1 (mod n).at n=6A094063
• Odd composite n such that n divides Fibonacci(n) + 1.at n=3A094395
• Composite numbers k that divide both Fibonacci(k+1) and Fibonacci(k) + 1.at n=2A094411
• Composite terms in A128288(n) = A023163(n)/3 for n>1.at n=6A128289
• a(n) = 81*n^2 - 90*n + 26.at n=31A154295
• Semiprimes k that divide Fibonacci(k+1).at n=16A177745
• Composite numbers k that divide both Fibonacci(k+1) and Fibonacci(2k+1)-1.at n=23A182504
• Frobenius pseudoprimes == 2,3 (mod 5) with respect to Fibonacci polynomial x^2 - x - 1.at n=2A212423
• Frobenius pseudoprimes with respect to Fibonacci polynomial x^2 - x - 1.at n=12A212424
• Strong Lucas pseudoprimes.at n=10A217255
• Numbers of the form n^2 + 1 without prime divisors of the form a^2 + 1.at n=26A217279
• Extra strong Lucas pseudoprimes.at n=11A217719
• 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=27A220292
• Smallest i such that prime(n) divides gcd(sigma(i), phi(i)) (cf. A009223).at n=24A222714