33385282

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=35A000204
• a(n+1) = a(n)*(a(n)^2 - 3) with a(0) = 7.at n=2A002000
• 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=36A005247
• Bisection of Lucas numbers: a(n) = L(2*n) = A000032(2*n).at n=18A005248
• Even Lucas numbers: a(n) = L(3*n).at n=12A014448
• Number of maximum matchings in the n-Moebius ladder M_n.at n=36A020878
• a(n) = Lucas(4*n).at n=9A056854
• Fibonacci-type sequence based on subtraction: a(0) = 1, a(1) = 2 and a(n) = a(n-2) - a(n-1).at n=37A061084
• a(n) = floor(tau^n) + 1, where tau = (1 + sqrt(5))/2.at n=36A062724
• Squarefree Lucas numbers.at n=26A063509
• Sum of Lucas numbers and inverted Lucas numbers: a(n) = A000032(n)*A075193(n).at n=34A075270
• 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=35A080023
• Lucas(6*n): a(n) = 18*a(n-1) - a(n-2), starting with a(0) = 2 and a(1) = 18.at n=6A087215
• a(n) = Lucas(9*n).at n=4A087287
• Lucas numbers L(12n).at n=3A089775
• Lucas numbers for which the sum of the digits is a Fibonacci number.at n=7A117765
• G.f.: x^2*(3+3*x-2*x^2)/ ( (x^2-x-1) * (x^2+x-1)).at n=35A122012
• a(n) = A014217(n+1) - A115360(n+2).at n=34A142584
• Lucas numbers with an equal number of odd and even digits.at n=9A144833
• a(n) = Lucas(6^n).at n=1A144838