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 A199575 #28 Jan 05 2025 19:51:39
%S A199575 0,1,1,1,1,1,1,1,2,2,2,3,3,3,4,4,5,6,7,8,9,10,11,13,14,16,18,21,23,26,
%T A199575 30,34,38,43,48,55,62,70,79,89,100,113,127,144,162,183,207,233,263,
%U A199575 296,334,377,426,480,541,611,689,777,876,989,1115,1258,1418,1600,1804,2035,2295,2589,2920,3293,3714,4189,4725,5329,6010,6778
%N A199575 a(n) = floor(Fibonacci(n)^(1/4)).
%C A199575 The Ferraro problem asks for a proof that, for n>=9, floor(F(n)^(1/4)) = floor(F(n-4)^(1/4)+F(n-8)^(1/4)). As of November 2005 this problem remained unsolved.
%H A199575 Vincenzo Librandi, <a href="/A199575/b199575.txt">Table of n, a(n) for n = 0..1000</a>
%H A199575 P. J. Ferraro, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Scanned/37-4/elementary37-4.pdf">Problem B-886</a>, Fibonacci Q., 37 (No. 4, Nov. 1999); 43 (No. 4, Nov. 2005), p. 372.
%H A199575 Raphael Schumacher, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Problems/ElemProbSolnNov2020.pdf">Solution to Problem B-886</a>, Fibonacci Q., 58 (No. 4, Nov. 2020) pp. 368-370.
%t A199575 Table[Floor[Fibonacci[n]^(1/4)], {n, 0, 80}] (* _Vincenzo Librandi_, Aug 28 2016 *)
%o A199575 (Magma) [Floor(Fibonacci(n)^(1/4)): n in [0..80]]; // _Vincenzo Librandi_, Aug 28 2016
%o A199575 (PARI) a(n) = sqrtnint(fibonacci(n), 4); \\ _Michel Marcus_, Aug 28 2016
%Y A199575 Cf. A061287.
%K A199575 nonn
%O A199575 0,9
%A A199575 _N. J. A. Sloane_, Nov 09 2011