167761

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=24A000204
• Associated Mersenne numbers.at n=25A001350
• A Fielder sequence: a(n) = a(n-1) + a(n-3) + a(n-4), n >= 4.at n=25A001638
• a(n) = 11*a(n-1) + a(n-2).at n=5A001946
• Bisection of Lucas sequence: a(n) = L(2*n+1).at n=12A002878
• 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=25A005013
• a(n) = floor(phi^n), where phi = (1+sqrt(5))/2 is the golden ratio.at n=25A014217
• Odd Lucas numbers.at n=16A014447
• Numerators of continued fraction convergents to sqrt(125).at n=8A041226
• Palindromes with exactly 3 palindromic prime factors (counted with multiplicity).at n=26A046377
• Palindromes with exactly 3 distinct palindromic prime factors.at n=11A046409
• a(n) = 4*a(n-1) + a(n-2); a(0)=1, a(1)=7.at n=8A048876
• Palindromic Lucas numbers (in the order of appearance).at n=6A055391
• a(n) = Lucas(4*n+1).at n=6A056914
• Squarefree Lucas numbers.at n=19A063509
• a(n) = Lucas(n) + (-1)^n + 1.at n=24A068397
• Expansion of (1-2*x)/(1+x-x^2).at n=24A075193
• 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=24A080023
• G.f.: (3+x+x^2+2*x^3)/(1-x^2-x^4).at n=46A082587
• G.f.: (3+x+x^2+2*x^3)/(1-x^2-x^4).at n=49A082587