271443

Appears in sequences

• Lucas numbers (beginning with 1): L(n) = L(n-1) + L(n-2) with L(1) = 1, L(2) = 3.at n=25A000204
• a(n) = 3*a(n-2) - a(n-4), a(0)=2, a(1)=1, a(2)=3, a(3)=2. Alternates Lucas (A000032) and Fibonacci (A000045) sequences for even and odd n.at n=26A005247
• Bisection of Lucas numbers: a(n) = L(2*n) = A000032(2*n).at n=13A005248
• Odd Lucas numbers.at n=17A014447
• Number of maximum matchings in the n-Moebius ladder M_n.at n=26A020878
• Fibonacci-type sequence based on subtraction: a(0) = 1, a(1) = 2 and a(n) = a(n-2) - a(n-1).at n=27A061084
• a(n) = floor(tau^n) + 1, where tau = (1 + sqrt(5))/2.at n=26A062724
• Squarefree Lucas numbers.at n=20A063509
• a(n) = gcd(1 + Fibonacci(n+1), 1 + Fibonacci(n)).at n=53A063726
• Sum of Lucas numbers and inverted Lucas numbers: a(n) = A000032(n)*A075193(n).at n=24A075270
• log_phi(n) is closer to an integer than is log_phi(m) for any m with 2<=m<n, where phi=(1+sqrt(5))/2 is the golden ratio.at n=25A080023
• G.f.: (3+x+x^2+2*x^3)/(1-x^2-x^4).at n=48A082587
• Transposition sequence of the Wythoff array.at n=98A114579
• a(n) = gcd(Lucas(n)-1, Fibonacci(n)+1).at n=50A115312
• Lucas numbers for which the sum of the digits is a Fibonacci number.at n=6A117765
• G.f.: x^2*(3+3*x-2*x^2)/ ( (x^2-x-1) * (x^2+x-1)).at n=25A122012
• a(n) = (F(2*n-1) + F(2*n+1))*(5/6 - cos(2*Pi*n/3)/3), where F(n) = Fibonacci(n).at n=13A128052
• Terms in A061725 that are of form 3*prime.at n=27A133395
• Antidiagonal sums of a triangle of coefficients of recurrences of the Fibonacci sequence.at n=50A138123
• Odd numbers in A138123.at n=24A142248