12752043

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=33A000204
• 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=34A005247
• Bisection of Lucas numbers: a(n) = L(2*n) = A000032(2*n).at n=17A005248
• Odd Lucas numbers.at n=22A014447
• Number of maximum matchings in the n-Moebius ladder M_n.at n=34A020878
• a(n) = 4*a(n-1) + a(n-2); a(0)=1, a(1)=7.at n=11A048876
• Shifts left two places under BIN1 transform.at n=34A052341
• Fibonacci-type sequence based on subtraction: a(0) = 1, a(1) = 2 and a(n) = a(n-2) - a(n-1).at n=35A061084
• a(n) = floor(tau^n) + 1, where tau = (1 + sqrt(5))/2.at n=34A062724
• Squarefree Lucas numbers.at n=24A063509
• a(n) = Lucas(Fibonacci(n)).at n=9A068098
• Sum of Lucas numbers and inverted Lucas numbers: a(n) = A000032(n)*A075193(n).at n=32A075270
• 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=33A080023
• Lucas numbers for which the product of the digits is a Fibonacci number.at n=13A117769
• G.f.: x^2*(3+3*x-2*x^2)/ ( (x^2-x-1) * (x^2+x-1)).at n=33A122012
• 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=17A128052
• Odd numbers in A138123.at n=32A142248
• Lucas numbers with an equal number of odd and even digits.at n=7A144833
• Numbers n such that n^2 can be expressed as the sum of three different nonzero Fibonacci numbers.at n=44A160238
• Number of n X 2 binary arrays with all 1s connected, a path of 1s from top row to lower right corner, and no 1 having more than two 1s adjacent.at n=32A163695