64079

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=22A000204
• Associated Mersenne numbers.at n=23A001350
• A Fielder sequence: a(n) = a(n-1) + a(n-3) + a(n-4), n >= 4.at n=23A001638
• Bisection of Lucas sequence: a(n) = L(2*n+1).at n=11A002878
• 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=23A005013
• Bruckman-Lucas pseudoprimes: k | (L_k - 1), where k is composite and L_k = Lucas numbers A000032.at n=16A005845
• a(n) = floor(phi^n), where phi = (1+sqrt(5))/2 is the golden ratio.at n=23A014217
• Odd Lucas numbers.at n=15A014447
• Numbers whose set of base-13 digits is {2,3}.at n=38A032813
• Composite n coprime to 5 such that Fibonacci(n) == Legendre(n,5) (mod n).at n=18A049062
• a(n) = F(n) / Product_{p|n} F(p), where F(k) is k-th Fibonacci number and the p's in product are the distinct primes dividing n.at n=45A051348
• Number of n-digit numbers with nonzero multiplicative digital root 7.at n=6A051818
• Primitive part of Lucas(n).at n=22A061447
• Squarefree Lucas numbers.at n=17A063509
• a(n) = Lucas(n) + (-1)^n + 1.at n=22A068397
• Composite numbers k such that k divides F(k-1) where F(j) are the Fibonacci numbers.at n=17A069106
• Sequence arising from factorization of the Fibonacci numbers.at n=22A072183
• Expansion of (1-2*x)/(1+x-x^2).at n=22A075193
• 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=22A080023
• Odd Fibonacci pseudoprimes: odd composite numbers k such that either (1) k divides Fibonacci(k-1) if k == +-1 (mod 5) or (2) k divides Fibonacci(k+1) if k == +-2 (mod 5).at n=33A081264