cp's OEIS Frontend

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.

A190993 Square excess of Fibonacci numbers.

This page as a plain text file.
%I A190993 #21 Oct 26 2022 20:07:52
%S A190993 0,0,0,1,2,1,4,4,5,9,6,8,0,8,16,34,26,76,84,85,41,130,22,96,143,496,
%T A190993 289,169,842,140,296,669,2684,1449,343,4096,7583,592,665,11682,699,
%U A190993 20452,2872,22037,6477,21826,17999,93009,46080,31240,121681,8638,317523
%N A190993 Square excess of Fibonacci numbers.
%H A190993 G. C. Greubel, <a href="/A190993/b190993.txt">Table of n, a(n) for n = 0..5000</a>
%p A190993 a:= n-> (f-> f-floor(sqrt(f))^2)((<<0|1>, <1|1>>^n)[1, 2]):
%p A190993 seq(a(n), n=0..52);  # _Alois P. Heinz_, Oct 26 2022
%t A190993 A000045=Fibonacci[Range[0,100]]; Table[A000045[[n]]-Floor[Sqrt[A000045[[n]]]]^2,{n,Length[A000045]}]
%o A190993 (PARI) a(n) = my(f=fibonacci(n)); f - sqrtint(f)^2; \\ _Michel Marcus_, Nov 11 2015
%o A190993 (Magma) [Fibonacci(n) - Floor(Sqrt(Fibonacci(n)))^2: n in [0..100]]; // _G. C. Greubel_, Oct 26 2022
%o A190993 (SageMath) [fibonacci(n) - isqrt(fibonacci(n))^2 for n in range(101)] # _G. C. Greubel_, Oct 26 2022
%Y A190993 Cf. A000045, A190992, A216223.
%K A190993 nonn
%O A190993 0,5
%A A190993 _Vladimir Joseph Stephan Orlovsky_, Jun 02 2011
%E A190993 a(0) prepended by _Alois P. Heinz_, Nov 11 2015