599074578

Appears in sequences

• a(n) = Lucas(5*n+2).at n=8A001947
• Bisection of Lucas numbers: a(n) = L(2*n) = A000032(2*n).at n=21A005248
• Even Lucas numbers: a(n) = L(3*n).at n=14A014448
• Numerators of continued fraction convergents to sqrt(320).at n=13A041604
• Lucas(6*n): a(n) = 18*a(n-1) - a(n-2), starting with a(0) = 2 and a(1) = 18.at n=7A087215
• a(n) = Lucas(7*n).at n=6A087281
• a(n) = L(P(n)), where P = A000041 (partition numbers) and L = A000032 (Lucas numbers).at n=10A100845
• Lucas numbers for which the product of the digits is a Fibonacci number.at n=18A117769
• Nonprime Lucas numbers.at n=28A172159
• Subsequence of A014217 (n=2,3,5,6,8,9,11,12,...).at n=27A182642
• a(0) = 2, a(n) = Lucas(phi(n^2)) for n > 0.at n=7A197190
• a(0) = 2, a(n) = Lucas(phi(n)) for n > 0.at n=43A197219
• Number of ways to place k non-attacking knights on a 2 X n horizontal cylinder, summed over all k>=0.at n=20A201222
• The smallest Lucas number having exactly n distinct prime factors.at n=5A229490
• Smallest Lucas number L(m) > L(n) that is divisible by the n-th Lucas number L(n) = A000204(n).at n=13A245580
• Numbers n such that n^2 + 1 is the product of three distinct Fibonacci numbers > 1.at n=19A245688
• Lucas numbers (A000204) of the form n^2 + 2.at n=11A246453
• Lucas numbers whose sum of decimal digits is greater than its index.at n=17A258740
• Lucas analog to A101361.at n=8A316275
• Solutions x to the Pell-Fermat equation x^2 - 5*y^2 = 4.at n=10A342710