103682

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=23A000204
• 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=24A005247
• Bisection of Lucas numbers: a(n) = L(2*n) = A000032(2*n).at n=12A005248
• Even Lucas numbers: a(n) = L(3*n).at n=8A014448
• Number of maximum matchings in the n-Moebius ladder M_n.at n=24A020878
• a(n) = Lucas(4*n).at n=6A056854
• Fibonacci-type sequence based on subtraction: a(0) = 1, a(1) = 2 and a(n) = a(n-2) - a(n-1).at n=25A061084
• a(n) = floor(tau^n) + 1, where tau = (1 + sqrt(5))/2.at n=24A062724
• Squarefree Lucas numbers.at n=18A063509
• a(n) = gcd(1 + Fibonacci(n+1), 1 + Fibonacci(n)).at n=49A063726
• Numbers k such that the period of the continued fraction for sqrt(5)*k is 2.at n=44A065030
• Sum of Lucas numbers and inverted Lucas numbers: a(n) = A000032(n)*A075193(n).at n=22A075270
• 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=23A080023
• G.f.: (3+x+x^2+2*x^3)/(1-x^2-x^4).at n=44A082587
• G.f.: (3+x+x^2+2*x^3)/(1-x^2-x^4).at n=47A082587
• Lucas(6*n): a(n) = 18*a(n-1) - a(n-2), starting with a(0) = 2 and a(1) = 18.at n=4A087215
• Lucas numbers L(8*n).at n=3A087265
• Lucas numbers L(12n).at n=2A089775
• a(n) is the number of images of the border correlation function for binary words of length n (cf. link).at n=23A091838
• a(n) = Lucas(n!).at n=4A101293