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 A263727 #17 Nov 25 2015 02:41:22 %S A263727 0,1,1,1,1,4,4,9,16,25,49,81,144,225,361,576,961,1521,2500,4096,6724, %T A263727 10816,17689,28561,46225,74529,121104,196249,316969,514089,831744, %U A263727 1345600,2175625,3523129,5702544,9223369,14922769,24157225,39087504,63234304,102333456 %N A263727 Largest square number less than or equal to the n-th Fibonacci number. %F A263727 a(n) = floor(sqrt(Fibonacci(n)))^2. %F A263727 a(n) = A061287(n)^2. - _Michel Marcus_, Oct 25 2015 %F A263727 a(n) = A048760(A000045(n)). - _Michel Marcus_, Nov 11 2015 %e A263727 For a(8), Fibonacci(8) = 21, the largest square under 21 is 16, so a(8) = 16. %t A263727 Floor[Sqrt[Fibonacci[Range[40]]]]^2 (* _Alonso del Arte_, Oct 24 2015 *) %o A263727 (PARI) a(n) = sqrtint(fibonacci(n))^2; \\ _Michel Marcus_, Oct 25 2015 %Y A263727 Cf. A000045, A048760, A061287. %K A263727 nonn,easy %O A263727 0,6 %A A263727 _Eli Jaffe_, Oct 24 2015