This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A293678 #8 Feb 17 2018 10:44:13 %S A293678 0,4,4,7,10,16,26,41,66,107,173,280,453,732,1185,1917,3101,5018,8118, %T A293678 13135,21253,34388,55641,90029,145670,235698,381368,617066,998433, %U A293678 1615499,2613931,4229429,6843360,11072789,17916148,28988937,46905085,75894021,122799105 %N A293678 a(n) is the least integer k such that k/Fibonacci(n) > Pi. %H A293678 Clark Kimberling, <a href="/A293678/b293678.txt">Table of n, a(n) for n = 0..1000</a> %F A293678 a(n) = ceiling(Pi*Fibonacci(n)). %F A293678 a(n) = A293677(n) + 1 for n > 0. %t A293678 z = 120; f[n_] := Fibonacci[n]; %t A293678 Table[Floor[Pi*f[n]], {n, 0, z}]; (* A293677 *) %t A293678 Table[Ceiling[Pi*f[n]], {n, 0, z}]; (* A293678 *) %t A293678 Table[Round[Pi*f[n]], {n, 0, z}]; (* A293679 *) %Y A293678 Cf. A000045, A000796, A293677, A293679. %K A293678 nonn,easy %O A293678 0,2 %A A293678 _Clark Kimberling_, Oct 16 2017