196559

Appears in sequences

• Lucas-Carmichael numbers: squarefree composite numbers k such that p | k => p+1 | k+1.at n=35A006972
• a(1) = 1; a(n) > 0; for each k from 1 to n, k divides a(n) or a(n)+1 and a(n) is the least such integer.at n=15A064219
• Composite k such that Fibonacci(k) == Legendre(k,5) == 1 (mod k).at n=30A093372
• Numbers k that divide both Fibonacci(k+1) and Lucas(k) + 1.at n=29A094402
• Odd numbers k that divide Fibonacci(k) - 1 but not Fibonacci(k-1).at n=31A094409
• Lucas-Carmichael numbers with 3 prime factors.at n=23A216925
• Least Lucas-Carmichael number divisible by the n-th prime.at n=26A253597
• a(n) = least Lucas-Carmichael number which is divisible by b(n), where {b(n)} (A255602) is the list of all numbers which could be a divisor of a Lucas-Carmichael number.at n=36A253598
• Euler elliptic Carmichael numbers for the elliptic curve y^2 = x^3 + 80.at n=33A290338
• Integers m such that m and m+1 are terms of A111035.at n=6A331977
• Numbers k such that k | Sum_{i=1..k} A000045(i) and k+1 | Sum_{i=1..k+1} A000045(i).at n=4A339598