A135958 - OEIS

This site is supported by donations to The OEIS Foundation.

A135958

a(n) = smallest prime p such that Fibonacci(p) has exactly n prime factors.

2, 3, 19, 37, 97, 229, 503, 367, 971 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,1`
	FORMULA	`a(n) = prime(A135957(n)).`
	CROSSREFS	`A135959 gives the Fibonacci numbers. Cf. A000045, A050937, A075737, A090819, A135957.` `Sequence in context: A142955 A088790 A178202 * A163665 A051079 A051089` `Adjacent sequences: A135955 A135956 A135957 * A135959 A135960 A135961`
	KEYWORD	`nonn,hard,less`
	AUTHOR	`Artur Jasinski (grafix(AT)csl.pl), Dec 08 2007`
	EXTENSIONS	`Edited and extended by David Wasserman (dwasserm(AT)earthlink.net), Mar 26 2008`

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

Last modified February 13 17:43 EST 2012. Contains 205523 sequences.