|
%I #12 Dec 20 2014 11:51:36
%S 2,8,38,62,122,158,218,278,302,362,398,422,458,482,542,662,698,758,
%T 818,842,878,884,902,998,1037,1082,1142,1157,1202,1238,1262,1322,1382,
%U 1418,1478,1502,1538,1622,1658,1718,1838,1982,2018,2042,2078,2102,2138
%N Numbers n such that Fibonacci(n-2) is divisible by n.
%H Reinhard Zumkeller, <a href="/A159051/b159051.txt">Table of n, a(n) for n = 1..1000</a>
%e 8=8/8=1, 38=14930352/38=392904, 62=1548008755920/62=24967883160, ...
%t lst={};Do[If[Mod[(Fibonacci[n-2]),n]==0,AppendTo[lst,n]],{n,7!}];lst
%t Select[Range[2,2200],Divisible[Fibonacci[#-2],#]&] (* _Harvey P. Dale_, Dec 20 2014 *)
%o (Haskell)
%o import Data.List (elemIndices)
%o a159051 n = a159051_list !! (n-1)
%o a159051_list = map (+ 2) $ elemIndices 0 $ zipWith mod a000045_list [2..]
%o -- _Reinhard Zumkeller_, Oct 13 2011
%o (PARI) is(n)=((Mod([1,1;1,0],n))^(n-2))[1,2]==0 \\ _Charles R Greathouse IV_, Feb 03 2014
%Y Cf. A123976, A000045, A023172, A069104.
%K nonn
%O 1,1
%A _Vladimir Joseph Stephan Orlovsky_, Apr 03 2009
|
