|
|
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
No further term between 48 and 320. - R. J. Mathar, Apr 01 2011
This sequence is complete. For proof see the Luca-Young paper in links section, pages 7-10. - Altug Alkan, Apr 26 2016
|
|
LINKS
|
|
|
FORMULA
|
|
|
MAPLE
|
with(combinat):with(numtheory): A160683 := proc(n) option remember: local k: if(n=1)then return 1:fi: for k from procname(n-1)+1 do if(fibonacci(k) mod tau(fibonacci(k))=0)then return k:fi: od: end: seq(A160683(n), n=1..6); # Nathaniel Johnston, May 09 2011
|
|
MATHEMATICA
|
Select[Range@ 120, IntegerQ[#/DivisorSigma[0, #]] &@ Fibonacci@ # &]
|
|
PROG
|
(PARI) isok(n) = my(f=fibonacci(n)); f % numdiv(f) == 0; \\ Michel Marcus, Jul 31 2015
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,fini,full
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|