id:A115101 - OEIS Search Results

Search: id:A115101

Displaying 1-1 of 1 results found.

page 1

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
1

1, 1, 1, 1, 2, 2, 2, 2, 2, 5, 4, 7, 7, 6 (list; graph; listen)

	OFFSET	`0,5`
	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.`
	CROSSREFS	`Cf. A000045, A000032, A115051.` `Sequence in context: A152659 A089452 A162487 this_sequence A023569 A051887 A139516` `Adjacent sequences: A115098 A115099 A115100 this_sequence A115102 A115103 A115104`
	KEYWORD	`more,nonn`
	AUTHOR	`Parthasarathy Nambi (PachaNambi(AT)yahoo.com), Mar 02 2006`

page 1

Search completed in 0.002 seconds

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.