|
| |
|
|
A069107
|
|
Composite n such that n divides F(n+1) where F(k) are the Fibonacci numbers.
|
|
12
| |
|
|
323, 377, 2834, 3827, 5777, 6479, 10877, 11663, 18407, 19043, 20999, 23407, 25877, 27323, 34943, 35207, 39203, 44099, 47519, 50183, 51983, 53663, 60377, 65471, 75077, 78089, 79547, 80189, 81719, 82983, 84279, 84419, 86063, 90287, 94667
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Primes p congruent to +2 or -2 (mod 5) divide F(p+1) (cf. A003631 and Hardy and Wright, An introduction to number theory, Chap. X, p. 150, Oxford University Press, Fifth edition).
|
|
|
LINKS
| Reinhard Zumkeller, Table of n, a(n) for n = 1..250
|
|
|
MATHEMATICA
| Select[Range[2, 100000], !PrimeQ[#]&&Divisible[Fibonacci[#+1], #]&] (* From Harvey P. Dale, Sep 18 2011 *)
|
|
|
PROG
| (Haskell)
a069107 n = a069107_list !! (n-1)
a069107_list = h 2 $ drop 3 a000045_list where
h n (fib:fibs) = if fib `mod` n > 0 || a010051 n == 1
then h (n+1) fibs else n : h (n+1) fibs
-- Reinhard Zumkeller, Oct 13 2011
|
|
|
CROSSREFS
| Cf. A045468, A003631, A064739, A081264 (Fibonacci pseudoprimes).
Cf. A000045, A010051, A023172, A069104.
Sequence in context: A082947 A082948 A081264 * A094412 A177745 A065822
Adjacent sequences: A069104 A069105 A069106 * A069108 A069109 A069110
|
|
|
KEYWORD
| easy,nice,nonn
|
|
|
AUTHOR
| Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 06 2002
|
|
|
EXTENSIONS
| Corrected by Ralf Stephan (ralf(AT)ark.in-berlin.de), Oct 17 2002
|
| |
|
|
