Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #17 Sep 08 2022 08:45:58
%S 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 321,409,521,662,842,1072,1364,1735,2206,2807,3571,4542,5777,7349,
%U 9349,11892,15126,19241,24476,31133,39602,50375,64079,81509,103681,131885
%N Floor-Sqrt transform of Lucas numbers (A000032).
%C This is the same as the floor-sqrt transform of phi^n, where phi = (1+sqrt(5))/2.
%H T. D. Noe, <a href="/A192660/b192660.txt">Table of n, a(n) for n = 0..1000</a>
%F a(n) = floor(sqrt(Lucas(n))).
%t Table[Floor[Sqrt[LucasL[n]]], {n,0,100}]
%o (Maxima) makelist(floor(sqrt(fib(n-1)+fib(n+1))),n,0,24);
%o (Magma) [Floor(Sqrt(Lucas(n))): n in [0..50]]; // _Vincenzo Librandi_, Sep 30 2017
%o (PARI) a(n) = sqrtint(fibonacci(n-1)+fibonacci(n+1)); \\ _Michel Marcus_, Sep 30 2017
%K nonn
%O 0,4
%A _Emanuele Munarini_, Jul 07 2011