id:A064739 - OEIS Search Results

Search: id:A064739

Displaying 1-1 of 1 results found.

page 1

Primes p such that Fibonacci(p)-1 is divisible by p.

+0
12

2, 11, 19, 29, 31, 41, 59, 61, 71, 79, 89, 101, 109, 131, 139, 149, 151, 179, 181, 191, 199, 211, 229, 239, 241, 251, 269, 271, 281, 311, 331, 349, 359, 379, 389, 401, 409, 419, 421, 431, 439, 449, 461, 479, 491, 499, 509, 521, 541, 569, 571, 599, 601, 619 (list; graph; listen)

	OFFSET	`1,1`
	FORMULA	`Presumably this consists of 2 together with the primes congruent to +-1 mod 5.`
	PROGRAM	`(PARI): forprime(p=2, 700, if((fibonacci(p)-1)%p==0, print1(p, " ")))`
	CROSSREFS	`{2} union A045468. Complement is A003631 minus {2}.` `Sequence in context: A019375 A078784 A117196 this_sequence A112860 A067931 A067660` `Adjacent sequences: A064736 A064737 A064738 this_sequence A064740 A064741 A064742`
	KEYWORD	`nonn`
	AUTHOR	`Shane Findley (TTpi314159(AT)cs.com) and njas, Oct 17 2001`
	EXTENSIONS	`More terms from Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Oct 18 2001`

page 1

Search completed in 0.005 seconds

Last modified July 4 18:25 EDT 2008. Contains 140886 sequences.

AT&T Labs Research