|
| |
|
|
A064739
|
|
Primes p such that Fibonacci(p)-1 is divisible by p.
|
|
14
| |
|
|
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; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
LINKS
| Harry J. Smith, Table of n, a(n) for n=1,...,1000
|
|
|
FORMULA
| Presumably this consists of 2 together with the primes congruent to +-1 mod 5.
|
|
|
MATHEMATICA
| lst={}; Do[p=Prime[n]; If[Mod[(Fibonacci[p]-1), p]==0, AppendTo[lst, p]], {n, 6!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Apr 03 2009]
|
|
|
PROG
| (PARI): forprime(p=2, 700, if((fibonacci(p)-1)%p==0, print1(p, " ")))
(PARI) { n=0; for (m=1, 10^9, p=prime(m); if ((fibonacci(p) - 1)%p==0, write("b064739.txt", n++, " ", p); if (n==1000, break)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 24 2009]
|
|
|
CROSSREFS
| {2} union A045468. Complement is A003631 minus {2}.
Sequence in context: A019375 A078784 A117196 * A112860 A152312 A154765
Adjacent sequences: A064736 A064737 A064738 * A064740 A064741 A064742
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Shane Findley (TTpi314159(AT)cs.com) and N. J. A. Sloane (njas(AT)research.att.com), Oct 17 2001
|
|
|
EXTENSIONS
| More terms from Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Oct 18 2001
|
| |
|
|
