

A166074


a(n) = n^2  [largest Fibonacci number <= n^2].


1



0, 1, 1, 3, 4, 2, 15, 9, 26, 11, 32, 0, 25, 52, 81, 23, 56, 91, 128, 23, 64, 107, 152, 199, 15, 66, 119, 174, 231, 290, 351, 37, 102, 169, 238, 309, 382, 457, 534, 3, 84, 167, 252, 339, 428, 519, 612, 707, 804, 903, 17, 120, 225, 332, 441, 552, 665, 780, 897, 1016, 1137
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,4


COMMENTS

The only numbers n where a(n)=0 are 1 and 12: a(1) = 1*1  1 = 0 and a(12) = 12*12  144 = 0. Cohn (1964) proved that 1 and 144 are the only Fibonacci numbers which are perfect squares. In general, for a positive integer k, how many Fibonacci numbers exist such that k = n^2  (largest Fibonacci number <= n^2)? The only proved answer is 2 for k=0.


LINKS



MATHEMATICA

a[n_]:=Block[{k=1}, While[Fibonacci[k]<=n^2, k++]; Return[n^2  Fibonacci[k  1]]]; Table[a[n], {n, 80}] (* Vincenzo Librandi, Jan 09 2019 *)
With[{fibs=Fibonacci[Range[40]]}, Table[n^2Select[Nearest[fibs, n^2, 2], #<= n^2&], {n, 70}]][[All, 1]] (* Harvey P. Dale, Feb 05 2019 *)


CROSSREFS



KEYWORD

easy,nonn


AUTHOR



EXTENSIONS

a(7) corrected and more terms appended by R. J. Mathar, Oct 08 2009


STATUS

approved



