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 A004937 #24 Dec 20 2023 08:05:07 %S A004937 0,3,5,8,10,13,16,18,21,24,26,29,31,34,37,39,42,45,47,50,52,55,58,60, %T A004937 63,65,68,71,73,76,79,81,84,86,89,92,94,97,99,102,105,107,110,113,115, %U A004937 118,120,123,126,128,131,134,136,139,141,144,147,149,152,154,157 %N A004937 a(n) = round(n*phi^2), where phi is the golden ratio, A001622. %H A004937 Amiram Eldar, <a href="/A004937/b004937.txt">Table of n, a(n) for n = 0..10000</a> %H A004937 Benoit Cloitre and Jeffrey Shallit, <a href="https://arxiv.org/abs/2312.11706">Some Fibonacci-Related Sequences</a>, arXiv:2312.11706 [math.CO], 2023. %t A004937 a[n_] := Round[n*GoldenRatio^2]; Array[a, 50, 0] (* _Amiram Eldar_, Jun 17 2022 *) %o A004937 (PARI) a(n)=round(n*(sqrt(5)+3)/2) \\ _Charles R Greathouse IV_, Aug 28 2016 %o A004937 (Magma) [Round((3+Sqrt(5))*n/2): n in [0..80]]; // _G. C. Greubel_, Sep 13 2023 %o A004937 (SageMath) [round(golden_ratio^2*n) for n in range(81)] # _G. C. Greubel_, Sep 13 2023 %Y A004937 Cf. A001622, A104457. %Y A004937 Cf. A004938 - A004955, A007067. %K A004937 nonn %O A004937 0,2 %A A004937 _N. J. A. Sloane_