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 A368649 #19 Jan 03 2024 06:21:24 %S A368649 4,7,11,14,18,22,25,29,33,36,40,43,47,51,54,58,62,65,69,72,76,80,83, %T A368649 87,90,94,98,101,105,109,112,116,119,123,127,130,134,137,141,145,148, %U A368649 152,156,159,163,166,170,174,177,181,185,188,192,195,199,203,206,210 %N A368649 a(n) = round(n*rho), where rho = (5+sqrt(5))/2. %C A368649 Also, the positive integers that do not appear in A118287. %H A368649 Paolo Xausa, <a href="/A368649/b368649.txt">Table of n, a(n) for n = 1..10000</a> %H A368649 Benoit Cloitre and Jeffrey Shallit, <a href="https://arxiv.org/abs/2312.11706">Some Fibonacci-Related Sequences</a>, arXiv:2312.11706 [math.CO], 2023-2024. %F A368649 a(n) = floor(n*(5+sqrt(5))/2 + 1/2). %t A368649 Round[Range[100](5+Sqrt[5])/2] (* _Paolo Xausa_, Jan 03 2024 *) %Y A368649 Cf. A003231, A118287, A296184. %K A368649 nonn %O A368649 1,1 %A A368649 _Jeffrey Shallit_, Jan 02 2024