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.

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

Offset

0,5

Links

Table of n, a(n) for n=0..16.

Example

If n=1 then L(1 + F(1)) = 3 (prime) and so the first term is 1.
If n=2 then L(2 + F(2)) = 4 = 2^2 and so the second term is also 1.
If n=3 then L(3 + F(3)) = 11 (prime) and so the third term is also 1.

Mathematica

Table[PrimeNu[LucasL[n+Fibonacci[n]]], {n, 17}] (* Harvey P. Dale, Apr 06 2019 *)

Crossrefs

Cf. A000045, A000032, A115051.

Sequence in context: A089452 A162487 A215924 * A241148 A172414 A266995

Adjacent sequences: A115098 A115099 A115100 * A115102 A115103 A115104

Keyword

more,nonn

Author

Parthasarathy Nambi, Mar 02 2006

Extensions

More terms from Sean A. Irvine, Feb 17 2010

Status

approved