370248451

Properties

Appears in sequences

• Bisection of Lucas sequence: a(n) = L(2*n+1).at n=20A002878
• Prime Lucas numbers (cf. A000032).at n=13A005479
• Odd Lucas numbers.at n=27A014447
• a(n) = Lucas(4*n+1).at n=10A056914
• Smallest primitive prime factor of the n-th Lucas number (A000032); i.e., L(n), L(0) = 2, L(1) = 1 and L(n) = L(n-1) + L(n-2).at n=41A058036
• Primitive part of Lucas(n).at n=40A061447
• Squarefree Lucas numbers.at n=30A063509
• Sequence arising from factorization of the Fibonacci numbers.at n=40A072183
• Largest prime dividing the n-th Lucas number (A000032); 1 when no such prime exists.at n=41A079451
• 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=21A093960
• Lucas numbers for which the sum of the digits is a Fibonacci number.at n=8A117765
• Lucas numbers for which the product of the digits is a Fibonacci number.at n=17A117769
• Primes corresponding to the indices of A059791.at n=11A118839
• Numbers n such that the quintic polynomial x^5 - 10*n*x^2 - 24*n has Galois group A_5 over rationals.at n=19A135064
• Smallest prime factor of Fibonacci(3n)-1, i.e., A020639(A000071(3n)).at n=26A138859
• Odd numbers in A138123.at n=39A142248
• Odd terms in A014217.at n=20A142718
• Primes which are the sum of four consecutive Fibonacci numbers.at n=11A153867
• Lucas(3n+2) = Fibonacci(3n+1) + Fibonacci(3n+3).at n=13A163063
• a(n) = Lucas(prime(n)).at n=12A180363