|
%I #9 Feb 16 2018 16:28:46
%S 0,3,3,6,9,14,22,36,58,93,150,242,392,634,1025,1659,2683,4342,7025,
%T 11366,18390,29755,48144,77898,126042,203940,329981,533920,863900,
%U 1397820,2261720,3659539,5921258,9580797,15502055,25082851,40584905,65667755,106252660
%N a(n) is the least integer k such that k/Fibonacci(n) > e.
%H Clark Kimberling, <a href="/A293675/b293675.txt">Table of n, a(n) for n = 0..1000</a>
%F a(n) = ceiling(e*Fibonacci(n)).
%F a(n) = A293674(n) + 1 for n > 0.
%t z = 120; f[n_] := Fibonacci[n];
%t Table[Floor[E*f[n]], {n, 0, z}]; (* A293674 *)
%t Table[Ceiling[E*f[n]], {n, 0, z}]; (* A293675 *)
%t Table[Round[E*f[n]], {n, 0, z}]; (* A293676 *)
%o (PARI) a(n) = ceil(exp(1)*fibonacci(n)); \\ _Michel Marcus_, Feb 16 2018
%Y Cf. A000045, A001113, A293674, A293676.
%K nonn,easy
%O 0,2
%A _Clark Kimberling_, Oct 16 2017
|
