7881196

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=32A000204
• Associated Mersenne numbers.at n=33A001350
• A Fielder sequence: a(n) = a(n-1) + a(n-3) + a(n-4), n >= 4.at n=33A001638
• Bisection of Lucas sequence: a(n) = L(2*n+1).at n=16A002878
• 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=33A005013
• a(n) = floor(phi^n), where phi = (1+sqrt(5))/2 is the golden ratio.at n=33A014217
• Even Lucas numbers: a(n) = L(3*n).at n=11A014448
• Numerators of continued fraction convergents to sqrt(20).at n=10A041030
• a(n) = Lucas(4*n+1).at n=8A056914
• a(n) = Lucas(n) + (-1)^n + 1.at n=32A068397
• Expansion of (1-2*x)/(1+x-x^2).at n=32A075193
• 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=32A080023
• a(n) = Lucas(11*n).at n=3A089772
• a(n) is the number of images of the border correlation function for binary words of length n (cf. link).at n=32A091838
• 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=17A093960
• a(2n) = A001906(n+1), a(2n+1) = A002878(n).at n=33A109794
• Row sums of inverse of number triangle A(n,k) = 1/L(n+1) if k <= n <= 2k, 0 otherwise, where L(n) = A000032(n).at n=34A127754
• Numbers n such that the quintic polynomial x^5 - 10*n*x^2 - 24*n has Galois group A_5 over rationals.at n=15A135064
• a(n) = A014217(n+1) - A115360(n+2).at n=31A142584
• Terms in A014217 pairwise swapped.at n=32A154699