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 A005752 #26 Jan 05 2025 19:51:33
%S A005752 0,1,1,5,4,1,9,5,16,11,4,19,11,1,20,9,31,19,5,31,16,45,29,11,44,25,4,
%T A005752 41,19,59,36,11,55,29,1,49,20,71,41,9,64,31,89,55,19,81,44,5,71,31,
%U A005752 100,59,16,89,45,121,76,29,109
%N A005752 a(n) = n^2 + n*floor(n*tau) - floor(n*tau)^2.
%H A005752 P. Fahr, <a href="http://d-nb.info/989505049/34">Infinite Gabriel-Roiter measures for the 3-Kronecker quiver</a>, PhD Thesis U. Bielefeld (2008) p 45
%H A005752 Clark Kimberling, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Papers1/45-4/quartkimberling04_2007.pdf">The equation m^2 - 4k = 5n^2 and unique representations of positive integers</a>, Fibonacci Quart. 45 (2007), no. 4, 304-312.
%H A005752 Rodica Simion, <a href="https://doi.org/10.1016/0012-365X(91)90061-6">Trees with 1-factors and oriented trees</a>, Discrete Math., 88 (1981), 97.
%H A005752 Rodica Simion, <a href="/A005750/a005750.pdf">Trees with 1-factors and oriented trees</a>, Discrete Math., 88 (1981), 97. (Annotated scanned copy)
%t A005752 Table[n^2 + n Floor[n #] - Floor[n #]^2 &@ GoldenRatio, {n, 0, 60}] (* _Michael De Vlieger_, Mar 06 2016 *)
%o A005752 (PARI) a(n) = my(fnt = floor(n*(sqrt(5)+1)/2)); n^2 + n*fnt - fnt^2; \\ _Michel Marcus_, Mar 05 2016
%K A005752 nonn
%O A005752 0,4
%A A005752 _N. J. A. Sloane_