%I #10 Feb 11 2014 19:05:30
%S 1,1,2,2,4,3,12,11,23,22,81,48,216,162,325,494,1504,861,3961,2706,
%T 6256,8051,27412,15456,60020,56028,130946,136205,496497,221878,
%U 1302841,1089155,2136108,2683712,6327404,4976784,23504904,18515449,38920607,40933662,161541601
%N Number of integers in {1, 2, ..., Fibonacci(n)} that are coprime to n.
%C Compare the definition of a(n) to phi(n) = number of integers in {1, 2, ..., n} that are coprime to n.
%e There are four integers in {1, 2, ..., Fibonacci(5) = 5} that are coprime to 5, i.e. 1, 2, 3, 4. Hence a(5) = 4.
%t h[n_] := Module[{l}, l = {}; For[i = 1, i <= Fibonacci[n], i++, If[GCD[i, n] == 1, l = Append[l, i]]]; l]; Table[Length[h[i]], {i, 1, 21}]
%t Table[Count[Range[Fibonacci[n]],_?(CoprimeQ[#,n]&)],{n,25}] (* _Harvey P. Dale_, Oct 31 2011 *)
%K nonn
%O 1,3
%A _Joseph L. Pe_, Oct 04 2002
%E More terms from Harvey P. Dale, Oct. 31 2011
%E a(26)-a(41) from _Donovan Johnson_, Nov 03 2011