A115101 - OEIS

This site is supported by donations to The OEIS Foundation.

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 (list; graph; refs; listen; history; text; internal format)

	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.`
	CROSSREFS	`Cf. A000045, A000032, A115051.` `Sequence in context: A089452 A162487 A215924 * A172414 A023569 A051887` `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`

Content is available under The OEIS End-User License Agreement .

Last modified May 21 14:48 EDT 2013. Contains 225504 sequences.