20633239

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=34A000204
• Associated Mersenne numbers.at n=35A001350
• A Fielder sequence: a(n) = a(n-1) + a(n-3) + a(n-4), n >= 4.at n=35A001638
• a(n) = 11*a(n-1) + a(n-2).at n=7A001946
• Bisection of Lucas sequence: a(n) = L(2*n+1).at n=17A002878
• a(n) = 3*a(n-2) - a(n-4), a(0)=0, a(1)=1, a(2)=1, a(3)=4. Alternates Fibonacci (A000045) and Lucas (A000032) sequences for even and odd n.at n=35A005013
• a(n) = floor(phi^n), where phi = (1+sqrt(5))/2 is the golden ratio.at n=35A014217
• Odd Lucas numbers.at n=23A014447
• Numerators of continued fraction convergents to sqrt(125).at n=10A041226
• Numerators of continued fraction convergents to sqrt(845).at n=8A042630
• Squarefree Lucas numbers.at n=25A063509
• a(n) = Lucas(n) + (-1)^n + 1.at n=34A068397
• Expansion of (1-2*x)/(1+x-x^2).at n=34A075193
• 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=34A080023
• a(n) = Lucas(7*n).at n=5A087281
• a(n) is the number of images of the border correlation function for binary words of length n (cf. link).at n=34A091838
• a(1) = 1, a(2) = 2, a(n+1) = n*a(1) + (n-1)*a(2) + ... + (n-r)*a(r+1) + ... + a(n).at n=18A093960
• a(0)=-1, a(1)=-1, a(n)=-3*a(n-1)-a(n-2) for n>1.at n=18A098149
• a(2n) = A001906(n+1), a(2n+1) = A002878(n).at n=35A109794
• Lucas numbers for which the product of the digits is a Fibonacci number.at n=14A117769