|
%I #37 Oct 10 2019 09:36:00
%S 1,2,5,19,73,309,1229,4959,19821,79597,318453,1274563,5097973,
%T 20397515,81591147,326371001,1305482159,5222040189,20888133573,
%U 83552798667,334211074959,1336845501841,5347382348679,21389531880435,85558125961121,342232529890275,1368930120480617,5475720508827645,21902882035220391,87611528574186091,350446114129452131,1401784457568941917,5607137830212707769
%N a(n) = 1+Sum_{k=1..2^n-1} A000010(k).
%C Number of fractions in Farey series of order 2^n-1.
%H D. T. Ashley, J. P. DeVoe, K. Perttunen, C. Pratt, and A. Zhigljavsky, <a href="http://esrg.sourceforge.net/docs/paper_brap_detailed.pdf">On Best Rational Approximations Using Large Integers</a>
%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Farey_sequence">Farey Sequence</a>
%F a(n) ~ (2^n-1)^2 / Pi.
%F a(n) = 2+A015614(2^n-1).
%F a(n) = A005728 (2^n-1). - _Michel Marcus_, Feb 27 2015
%e For each n, measure the size of the set of reduced fractions with a denominator less than 2^n:
%e a(0) = 1 since the set of reduced fractions with denominator less than 2^0 = 1 is {0}.
%e a(1) = 2 since the set of reduced fractions with denominator less than 2^1 = 2 is {0, 1}.
%e a(2) = 5 since the set of reduced fractions with denominator less than 2^2 = 4 is {0, 1/3, 1/2, 2/3, 1}.
%e a(3) = 19 since the set of reduced fractions with denominator less than 2^3 = 8 is {0, 1/7, 1/6, 1/5, 1/4, 2/7, 1/3, 2/5, 3/7, 1/2, 4/7, 3/5, 2/3, 5/7, 3/4, 4/5, 5/6, 6/7, 1}.
%t k = s = 1; lst = {}; Do[While[k < 2^n, s = s + EulerPhi@ k; k++]; AppendTo[lst, s], {n, 0, 26}]; lst
%t a[n_] := 1 + (1/2) Sum[ MoebiusMu[k]*Floor[n/k]*Floor[1 + n/k], {k, n}]; Array[a, 27, 0]
%Y Cf. A007305, A007306, A000010, A049643, A006842/A006843 (Farey fractions).
%K nonn
%O 0,2
%A _Robert G. Wilson v_, Feb 24 2015
|
