OFFSET
1,2
COMMENTS
Are all numbers of the form 2^m*24 and 2^m*64, m >= 0, in the sequence?
This sequence is infinite (Luca, 2002). - Amiram Eldar, Jan 12 2022
LINKS
Florian Luca, Problem H-590, Advanced Problems and Solutions, The Fibonacci Quarterly, Vol. 40, No. 5 (2002), p. 472; Arithmetic Functions of Fibonacci Numbers, Solution to Problem H-590 by J.-Ch. Schlage-Puchta and J. Spilker, ibid., Vol. 41, No. 4 (2002), pp. 382-384.
MAPLE
with(combinat): with(numtheory): a:=proc(n) if type(tau(fibonacci(n))/n, integer) then n fi end: seq(a(n), n=1..200); # Emeric Deutsch, Jan 30 2006
MATHEMATICA
With[{nn=200}, Select[Thread[{DivisorSigma[0, Fibonacci[Range[nn]]], Range[nn]}], Divisible[#[[1]], #[[2]]]&]][[All, 2]] (* The program generates the first 8 terms of the sequence. To generate more, increase the value of nn but the program may take a long time to run. *) (* Harvey P. Dale, Feb 17 2021 *)
PROG
(PARI) isok(n) = ! (numdiv(fibonacci(n)) % n); \\ Michel Marcus, Sep 10 2017
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Benoit Cloitre, Sep 03 2002
EXTENSIONS
a(9) from Emeric Deutsch, Jan 30 2006
a(10)-a(19) from Charles R Greathouse IV, Nov 07 2016
STATUS
approved