OFFSET
1,2
COMMENTS
Corollary 1 in Riasat (2011), "every positive integer divides infinitely many Fibonacci numbers," demonstrates that this sequence is infinite. - Alonso del Arte, Jul 27 2013
Note that F(0)=0 is divisible by any n > 0, hence "positive" is added in NAME. - Zak Seidov, Jan 07 2016
LINKS
Alois P. Heinz, Table of n, a(n) for n = 1..1000 (first 500 terms from T. D. Noe)
Samin Riasat, Z[phi] and the Fibonacci Sequence Modulo n, Mathematical Reflections 1 (2011) pp. 1-7.
FORMULA
a(n) = n * A037943(n). - Alois P. Heinz, Jan 08 2017
EXAMPLE
Fibonacci(12) = 144 is the first Fibonacci number that is divisible by 6, so a(6) = 144.
MATHEMATICA
With[{fibs = Fibonacci[Range[150]]}, Flatten[Table[Select[fibs, Divisible[#, n] &, 1], {n, 60}]]] (* Harvey P. Dale, Oct 20 2011 *)
PROG
(PARI) a(n)=my(k); while(fibonacci(k++)%n, ); fibonacci(k) \\ Charles R Greathouse IV, Feb 04 2014
CROSSREFS
KEYWORD
easy,nice,nonn
AUTHOR
EXTENSIONS
More terms from Patrick De Geest, Jun 15 1999
STATUS
approved