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 A293401 #4 Oct 11 2017 18:14:45 %S A293401 0,2,7,15,26,41,59,80,104,132,162,196,233,274,318,365,415,468,525,585, %T A293401 648,714,784,856,932,1012,1094,1180,1269,1361,1457,1555,1657,1763, %U A293401 1871,1983,2097,2216,2337,2462,2589 %N A293401 Least integer k such that k/n^2 > (1 + sqrt(5))/2 (the golden ratio). %H A293401 Clark Kimberling, <a href="/A293401/b293401.txt">Table of n, a(n) for n = 0..1000</a> %F A293401 a(n) = ceiling(r*n^2), where r = (1 + sqrt(5))/2. %F A293401 a(n) = A293400(n) + 1 for n > 0. %t A293401 z = 120; r = GoldenRatio; %t A293401 Table[Floor[r*n^2], {n, 0, z}]; (* A293400 *) %t A293401 Table[Ceiling[r*n^2], {n, 0, z}]; (* A293401 *) %t A293401 Table[Round[r*n^2], {n, 0, z}]; (* A293402 *) %Y A293401 Cf. A001622, A293400, A293402. %K A293401 nonn,easy %O A293401 0,2 %A A293401 _Clark Kimberling_, Oct 11 2017