login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A063595 a(n) = floor(sqrt(Fibonacci(n+1)) - sqrt(Fibonacci(n))). 1

%I #14 Jun 25 2018 22:56:40

%S 1,0,0,0,0,0,0,0,1,1,2,2,3,4,5,6,8,10,13,17,22,28,36,46,58,74,94,120,

%T 153,195,248,315,401,510,649,826,1051,1336,1700,2163,2751,3500,4452,

%U 5663,7204,9163,11656,14827,18860,23991,30517,38818,49378,62810,79895

%N a(n) = floor(sqrt(Fibonacci(n+1)) - sqrt(Fibonacci(n))).

%H Harry J. Smith, <a href="/A063595/b063595.txt">Table of n, a(n) for n = 0..500</a>

%t Floor[Last[#]-First[#]]&/@Partition[Sqrt[Fibonacci[Range[0,60]]],2,1] (* _Harvey P. Dale_, Feb 19 2013 *)

%o (PARI) ? j=[]; for(n=0,100,j=concat(j,floor(sqrt(fibonacci(n+1))-(sqrt(fibonacci (n)))))); j

%o (PARI) { default(realprecision, 50); g=0; f=1; for (n=0, 500, write("b063595.txt", n, " ", floor(sqrt(f) - sqrt(g))); h=g; g=f; f+=h ) } \\ _Harry J. Smith_, Aug 26 2009

%K nonn

%O 0,11

%A _Jason Earls_, Aug 10 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 01:36 EDT 2024. Contains 371264 sequences. (Running on oeis4.)