id:A079669 - OEIS Search Results

Search: id:A079669

Displaying 1-1 of 1 results found.

page 1

Least k such that the distance from F(k) to closest prime = n or zero if no k was found where F(k) is the k-th Fibonacci number.

+0
1

1, 8, 9, 16, 12, 37, 42, 149, 33, 26, 27, 38, 24, 28, 189, 44, 111, 50, 66, 49, 57, 68, 30, 46, 81, 142, 78, 92, 96, 59, 69, 71, 141, 184, 267, 67, 129, 61, 117, 211, 576, 115, 372, 161, 138, 119, 198 (list; graph; listen)

	OFFSET	`0,2`
	PROGRAM	`(PARI) a(n)=if(n<0, 0, s=1; while(abs(n-min(abs(precprime(fibonacci(s))-fibonacci(s)), abs(nextprime(fibonacci(s))-fibonacci(s))))>0, s++); s)`
	CROSSREFS	`Cf. A051699, A000045.` `Adjacent sequences: A079666 A079667 A079668 this_sequence A079670 A079671 A079672` `Sequence in context: A101765 A050688 A134334 this_sequence A047393 A037371 A046790`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 26 2003`

page 1

Search completed in 0.002 seconds

Last modified October 11 09:12 EDT 2008. Contains 144832 sequences.

AT&T Labs Research