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 A192660 #17 Sep 08 2022 08:45:58
%S A192660 1,1,1,2,2,3,4,5,6,8,11,14,17,22,29,36,46,59,76,96,122,156,199,253,
%T A192660 321,409,521,662,842,1072,1364,1735,2206,2807,3571,4542,5777,7349,
%U A192660 9349,11892,15126,19241,24476,31133,39602,50375,64079,81509,103681,131885
%N A192660 Floor-Sqrt transform of Lucas numbers (A000032).
%C A192660 This is the same as the floor-sqrt transform of phi^n, where phi = (1+sqrt(5))/2.
%H A192660 T. D. Noe, <a href="/A192660/b192660.txt">Table of n, a(n) for n = 0..1000</a>
%F A192660 a(n) = floor(sqrt(Lucas(n))).
%t A192660 Table[Floor[Sqrt[LucasL[n]]], {n,0,100}]
%o A192660 (Maxima) makelist(floor(sqrt(fib(n-1)+fib(n+1))),n,0,24);
%o A192660 (Magma) [Floor(Sqrt(Lucas(n))): n in [0..50]]; // _Vincenzo Librandi_, Sep 30 2017
%o A192660 (PARI) a(n) = sqrtint(fibonacci(n-1)+fibonacci(n+1)); \\ _Michel Marcus_, Sep 30 2017
%K A192660 nonn
%O A192660 0,4
%A A192660 _Emanuele Munarini_, Jul 07 2011