4870847

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=31A000204
• a(0) = 3; thereafter, a(n) = a(n-1)^2 - 2.at n=4A001566
• a(n) = Lucas(5*n+2).at n=6A001947
• An infinite coprime sequence defined by recursion.at n=7A002715
• 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=32A005247
• Bisection of Lucas numbers: a(n) = L(2*n) = A000032(2*n).at n=16A005248
• Odd Lucas numbers.at n=21A014447
• Number of maximum matchings in the n-Moebius ladder M_n.at n=32A020878
• Numerators of continued fraction convergents to sqrt(45).at n=15A041076
• Numerators of continued fraction convergents to sqrt(245).at n=13A041458
• Products of distinct terms of 1 and rest from A001566: a(n) = Product_{i=0..floor(log_2(n+1))} L(2^i)^bit(n,i).at n=32A050613
• Products of distinct terms of 1 and rest from A001566: a(n) = Product_{i=0..floor(log_2(n+1))} L(2^i)^bit(n,i).at n=33A050613
• Products of distinct terms of A001566: a(n) = Product_{i=0..floor(log_2(n+1))} L(2^(i+1))^bit(n,i).at n=16A050614
• a(n) is the n-th term in sequence A_n, respecting the offset, or a(n) = -1 if A_n has fewer than n terms.at n=31A051070
• a(n) = Lucas(4*n).at n=8A056854
• Fibonacci-type sequence based on subtraction: a(0) = 1, a(1) = 2 and a(n) = a(n-2) - a(n-1).at n=33A061084
• Primitive part of Lucas(n).at n=31A061447
• a(n) = floor(tau^n) + 1, where tau = (1 + sqrt(5))/2.at n=32A062724
• Squarefree Lucas numbers.at n=23A063509
• Sum_{i=0..2*A053645(n)} (C(2*A053645(n),i) mod 2)*A000045(n-i) [where C(r,c) is the binomial coefficient (A007318) and A000045(n) is the n-th Fibonacci number].at n=33A075149