|
| |
|
|
A090819
|
|
Primes p such that the p-th Fibonacci number is nonprime.
|
|
20
| |
|
|
2, 19, 31, 37, 41, 53, 59, 61, 67, 71, 73, 79, 89, 97, 101, 103, 107, 109, 113, 127, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Fibonacci(37) = 24157817 = 73*149*221.
|
|
|
LINKS
| F. J. van de Bult, D. C. Gijswijt, J. P. Linderman, N. J. A. Sloane and A. R. Wilks, A Slow-Growing Sequence Defined by an Unusual Recurrence, J. Integer Sequences, Vol. 10 (2007), #07.1.2.
F. J. van de Bult, D. C. Gijswijt, J. P. Linderman, N. J. A. Sloane and A. R. Wilks, A Slow-Growing Sequence Defined by an Unusual Recurrence [pdf, ps].
|
|
|
PROG
| (PARI) f(n) = forprime(x=2, n, p=fibonacci(x); if(!isprime(p), print1(x", ")))
|
|
|
CROSSREFS
| Essentially the same as A038672.
Sequence in context: A102617 A120276 A006962 * A059697 A103058 A161442
Adjacent sequences: A090816 A090817 A090818 * A090820 A090821 A090822
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Cino Hilliard (hillcino368(AT)gmail.com), Feb 11 2004
|
|
|
EXTENSIONS
| Definition corrected by Don Reble, Sep 04 2008
|
| |
|
|
