A076519 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A076519

Numbers n such that Fibonacci(n) == prime(n) (mod n).

1, 2, 3, 4, 68, 76, 116, 181, 357, 789, 1251, 3861, 40087, 125902, 201986, 251737, 846623, 936418, 1327269, 2003626, 3546266, 4124468, 4832054, 4866214, 5086202, 5627521, 92660777, 331915497, 339145743, 394668171, 472845243, 679387634 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`1,2`
	COMMENTS	`a(33) > 2*10^9. - Giovanni Resta, Jul 20 2013`
	LINKS	`Table of n, a(n) for n=1..32.`
	MATHEMATICA	`Select[Range[3*10^4], Mod[Fibonacci[ # ], # ] == Mod[Prime[ # ], # ] &]`
	CROSSREFS	`Sequence in context: A004855 A097930 A012322 * A066776 A115901 A073325` `Adjacent sequences: A076516 A076517 A076518 * A076520 A076521 A076522`
	KEYWORD	`nonn`
	AUTHOR	`Joseph L. Pe, Oct 17 2002`
	EXTENSIONS	`a(13)-a(32) from Giovanni Resta, Jul 20 2013`
	STATUS	`approved`

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 2 23:17 EST 2023. Contains 367526 sequences. (Running on oeis4.)