80189

Appears in sequences

• Bruckman-Lucas pseudoprimes: k | (L_k - 1), where k is composite and L_k = Lucas numbers A000032.at n=21A005845
• Lucas-Carmichael numbers: squarefree composite numbers k such that p | k => p+1 | k+1.at n=22A006972
• Squarefree n such that the elliptic curve n*y^2 = x^3 - x arising in the "congruent number" problem has rank 3 and nontrivial SHA[2].at n=2A062694
• Composite numbers k that divide Fibonacci(k+1).at n=27A069107
• Odd composite n such that n divides Fibonacci(n) + 1.at n=4A094395
• Composite numbers k that divide both Fibonacci(k+1) and Fibonacci(k) + 1.at n=3A094411
• Lucas-Carmichael numbers that are not congruent to 11 (mod 12).at n=3A110885
• Composite terms in A128288(n) = A023163(n)/3 for n>1.at n=7A128289
• Sum of primes < 2^n.at n=9A130739
• Sum of primes < n^2.at n=32A139562
• A051838 gives numbers m such that the sum of first m primes divides the product of the first m primes. This sequence gives corresponding values of the sum of first m primes.at n=38A140763
• Composite numbers k that divide both Fibonacci(k+1) and Fibonacci(2k+1)-1.at n=26A182504
• Coefficient of x^n in the series 1/(1-x*F(1/2,1/2;1;16x)), where F(a1,a2;b;x) is the hypergeometric series.at n=6A188267
• Lucas-Carmichael numbers with 3 prime factors.at n=16A216925
• Least Lucas-Carmichael number divisible by the n-th prime.at n=22A253597
• 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=31A253598
• Numbers in A007504 such that omega(a(n)) = Omega(a(n)) = 3.at n=28A264885
• Lucas-Carmichael numbers that are congruent to 1 (mod 4).at n=1A292021
• 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=15A337625