39603

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=21A000204
• a(n) = Lucas(5*n+2).at n=4A001947
• 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=22A005247
• Bisection of Lucas numbers: a(n) = L(2*n) = A000032(2*n).at n=11A005248
• Odd Lucas numbers.at n=14A014447
• Poincaré series [or Poincare series] (or Molien series) for mod 2 cohomology of universal W-group W(4).at n=10A014697
• Number of maximum matchings in the n-Moebius ladder M_n.at n=22A020878
• a(n) = 4*a(n-1) + a(n-2); a(0)=1, a(1)=7.at n=7A048876
• Shifts left two places under BIN1 transform.at n=22A052341
• Fibonacci-type sequence based on subtraction: a(0) = 1, a(1) = 2 and a(n) = a(n-2) - a(n-1).at n=23A061084
• a(n) = floor(tau^n) + 1, where tau = (1 + sqrt(5))/2.at n=22A062724
• Squarefree Lucas numbers.at n=16A063509
• a(n) = gcd(1 + Fibonacci(n+1), 1 + Fibonacci(n)).at n=45A063726
• Sum of Lucas numbers and inverted Lucas numbers: a(n) = A000032(n)*A075193(n).at n=20A075270
• 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=21A080023
• G.f.: (3+x+x^2+2*x^3)/(1-x^2-x^4).at n=43A082587
• G.f.: (3+x+x^2+2*x^3)/(1-x^2-x^4).at n=40A082587
• a(n) = Lucas(11*n).at n=2A089772
• a(0) = 1; a(1) = 2; a(n) = { a(n-1) + a(n-2) for n even, a(n-1) - a(n-2) for n odd }.at n=42A090244
• a(n) = L(P(n)), where P = A000041 (partition numbers) and L = A000032 (Lucas numbers).at n=8A100845