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 A080081 #27 Feb 16 2025 08:32:48 %S A080081 3,6,9,13,16,19,23,26,29,33,36,39,42,46,49,52,56,59,62,66,69,72,75,79, %T A080081 82,85,89,92,95,99,102,105,108,112,115,118,122,125,128,132,135,138, %U A080081 142,145,148,151,155,158,161,165,168,171,175,178,181,184,188,191,194,198,201,204,208,211,214,217,221,224,227,231,234,237,241,244,247,251,254,257,260 %N A080081 Beatty sequence for (3+sqrt(13))/2. %C A080081 a(1)=3; for n>1, a(n+1)=a(n)+4 if n is already in the sequence, a(n+1)=a(n)+3 otherwise. %C A080081 a(n)-1 is the index of the n-th 1 in sequence A276397. - _M. F. Hasler_, Oct 07 2016 %H A080081 Vincenzo Librandi, <a href="/A080081/b080081.txt">Table of n, a(n) for n = 1..10000</a> %H A080081 B. Cloitre, N. J. A. Sloane and M. J. Vandermast, <a href="http://www.emis.de/journals/JIS/VOL6/Cloitre/cloitre2.html">Numerical analogues of Aronson's sequence</a>, J. Integer Seqs., Vol. 6 (2003), #03.2.2. %H A080081 B. Cloitre, N. J. A. Sloane and M. J. Vandermast, <a href="http://arXiv.org/abs/math.NT/0305308">Numerical analogues of Aronson's sequence</a>, arXiv:math/0305308 [math.NT], 2003. %H A080081 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/BeattySequence.html">Beatty Sequence</a>. %H A080081 <a href="/index/Be#Beatty">Index entries for sequences related to Beatty sequences</a>. %t A080081 Floor[Range[100]*(3 + Sqrt[13])/2] (* _Paolo Xausa_, Jul 08 2024 *) %o A080081 (Magma) [Floor(n*(3+Sqrt(13))/2): n in [1..80]]; // _Vincenzo Librandi_, Oct 25 2011 %o A080081 (PARI) A080081(n)=n*(3+sqrt(13))\2 \\ _M. F. Hasler_, Oct 07 2016 %Y A080081 Cf. A098316. %Y A080081 Differs from A059550 at 76th term. %K A080081 nonn,easy %O A080081 1,1 %A A080081 _N. J. A. Sloane_, Mar 15 2003