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 A293677 #9 Feb 17 2018 10:44:11 %S A293677 0,3,3,6,9,15,25,40,65,106,172,279,452,731,1184,1916,3100,5017,8117, %T A293677 13134,21252,34387,55640,90028,145669,235697,381367,617065,998432, %U A293677 1615498,2613930,4229428,6843359,11072788,17916147,28988936,46905084,75894020,122799104 %N A293677 a(n) is the greatest integer k such that k/Fibonacci(n) < Pi. %H A293677 Clark Kimberling, <a href="/A293677/b293677.txt">Table of n, a(n) for n = 0..1000</a> %F A293677 a(n) = floor(Pi*Fibonacci(n)). %F A293677 a(n) = A293678(n) - 1 for n > 0. %t A293677 z = 120; f[n_] := Fibonacci[n]; %t A293677 Table[Floor[Pi*f[n]], {n, 0, z}]; (* A293677 *) %t A293677 Table[Ceiling[Pi*f[n]], {n, 0, z}]; (* A293678 *) %t A293677 Table[Round[Pi*f[n]], {n, 0, z}]; (* A293696 *) %Y A293677 Cf. A000045, A000796, A293678, A293679. %K A293677 nonn,easy %O A293677 0,2 %A A293677 _Clark Kimberling_, Oct 16 2017