%I #14 Feb 17 2018 12:23:38
%S 0,3,3,6,9,16,25,41,66,107,173,280,452,732,1184,1916,3101,5017,8118,
%T 13135,21253,34388,55641,90029,145669,235698,381367,617065,998433,
%U 1615498,2613931,4229429,6843360,11072788,17916148,28988936,46905084,75894020,122799105
%N a(n) is the integer k that minimizes |k/Fibonacci(n) - Pi|.
%H Clark Kimberling, <a href="/A293679/b293679.txt">Table of n, a(n) for n = 0..1000</a>
%F a(n) = floor(1/2 + Pi*Fibonacci(n)).
%F a(n) = A293677(n) if (fractional part of Pi*Fibonacci(n)) < 1/2, otherwise a(n) = A293678(n).
%t z = 120; f[n_] := Fibonacci[n];
%t Table[Floor[Pi*f[n]], {n, 0, z}]; (* A293677 *)
%t Table[Ceiling[Pi*f[n]], {n, 0, z}]; (* A293678 *)
%t Table[Round[Pi*f[n]], {n, 0, z}]; (* A293679 *)
%Y Cf. A000045, A000796, A293677, A293678.
%K nonn,easy,base
%O 0,2
%A _Clark Kimberling_, Oct 16 2017
|