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 A080600 #24 Jul 29 2025 16:15:22
%S A080600 0,4,7,10,14,17,20,24,27,30,34,37,40,43,47,50,53,57,60,63,67,70,73,76,
%T A080600 80,83,86,90,93,96,100,103,106,109,113,116,119,123,126,129,133,136,
%U A080600 139,143,146,149,152,156,159,162,166,169,172,176,179,182,185,189
%N A080600 a(n) = ceiling(n*(3 + sqrt(13))/2).
%C A080600 a(0)=0, a(1)=4; for n > 1, a(n) = a(n-1) + 4 if n is already in the sequence, a(n) = a(n-1) + 3 otherwise.
%C A080600 In the Fokkink-Joshi paper, this sequence is the Cloitre (0,4,4,3)-hiccup sequence. - _Michael De Vlieger_, Jul 29 2025
%H A080600 Michael De Vlieger, <a href="/A080600/b080600.txt">Table of n, a(n) for n = 0..10000</a>
%H A080600 Benoit Cloitre, <a href="https://arxiv.org/abs/2506.18103">A study of a family of self-referential sequences</a>, arXiv:2506.18103 [math.GM], 2025. See p. 7.
%H A080600 Benoit Cloitre, N. J. A. Sloane and M. J. Vandermast, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL6/Cloitre/cloitre2.html">Numerical analogues of Aronson's sequence</a>, J. Integer Seqs., Vol. 6 (2003), #03.2.2.
%H A080600 Benoit Cloitre, N. J. A. Sloane and M. J. Vandermast, <a href="https://arxiv.org/abs/math/0305308">Numerical analogues of Aronson's sequence</a>, arXiv:math/0305308 [math.NT], 2003.
%H A080600 Robbert Fokkink and Gandhar Joshi, <a href="https://arxiv.org/abs/2507.16956">On Cloitre's hiccup sequences</a>, arXiv:2507.16956 [math.CO], 2025. See p. 3.
%t A080600 With[{c=(3+Sqrt[13])/2},Table[Ceiling[c*n],{n,0,60}]] (* _Harvey P. Dale_, Oct 30 2021 *)
%Y A080600 Equals A080081 + 1 for n > 0. Cf. A080455-A080458, A080036, A080037.
%K A080600 nonn
%O A080600 0,2
%A A080600 _N. J. A. Sloane_, Mar 23 2003