1149851

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=28A000204
• Associated Mersenne numbers.at n=29A001350
• A Fielder sequence: a(n) = a(n-1) + a(n-3) + a(n-4), n >= 4.at n=29A001638
• Bisection of Lucas sequence: a(n) = L(2*n+1).at n=14A002878
• 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=29A005013
• a(n) = L(L(n)), where L(n) are Lucas numbers A000032.at n=7A005371
• a(n) = floor(phi^n), where phi = (1+sqrt(5))/2 is the golden ratio.at n=29A014217
• Odd Lucas numbers.at n=19A014447
• a(n) = Lucas(4*n+1).at n=7A056914
• Primitive part of Lucas(n).at n=28A061447
• Squarefree Lucas numbers.at n=21A063509
• a(n) = Lucas(n) + (-1)^n + 1.at n=28A068397
• Sequence arising from factorization of the Fibonacci numbers.at n=28A072183
• Expansion of (1-2*x)/(1+x-x^2).at n=28A075193
• 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=28A080023
• Duplicate of A005371.at n=7A081255
• a(n) = L(P(n)), where L = Lucas numbers A000032, P = Pell numbers A000129.at n=5A081323
• Sums of two consecutive nonprime Fibonacci numbers (A090206).at n=20A090208
• a(n) is the number of images of the border correlation function for binary words of length n (cf. link).at n=28A091838
• 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=15A093960