The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A115101 Number of distinct prime factors of L(n + F(n)) where F(n) is the Fibonacci number and L(n) is the Lucas number and n >= 1. 0

%I #7 Apr 06 2019 13:50:22

%S 1,1,1,1,2,2,2,2,2,5,4,7,7,6,10,7,8

%N Number of distinct prime factors of L(n + F(n)) where F(n) is the Fibonacci number and L(n) is the Lucas number and n >= 1.

%e If n=1 then L(1 + F(1)) = 3 (prime) and so the first term is 1.

%e If n=2 then L(2 + F(2)) = 4 = 2^2 and so the second term is also 1.

%e If n=3 then L(3 + F(3)) = 11 (prime) and so the third term is also 1.

%t Table[PrimeNu[LucasL[n+Fibonacci[n]]],{n,17}] (* _Harvey P. Dale_, Apr 06 2019 *)

%Y Cf. A000045, A000032, A115051.

%K more,nonn

%O 0,5

%A _Parthasarathy Nambi_, Mar 02 2006

%E More terms from _Sean A. Irvine_, Feb 17 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 3 16:11 EDT 2024. Contains 373063 sequences. (Running on oeis4.)