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 A207673 #8 Jun 10 2020 07:49:39
%S A207673 4,8,13,17,21,26,30,35,39,43,48,53,57,62,66,71,75,79,84,88,93,97,102,
%T A207673 107,111,115,120,124,129,133,137,142,146,151,156,160,165,169,173,178,
%U A207673 182,187,191,195,201,205,209,214,218,223,227,231,236,240,245
%N A207673 n+[nr/s]+[nt/s], where []=floor, r=5, s=(1+sqrt(5))/2, t=1/s.
%C A207673 The sequences A207672, A207673, A208326 partition the positive integers. To generate them, jointly rank the sets {i/r}, {j/s}, {k*s}. The positions of n/r in the joint ranking form A207672, and likewise for the other sequences.
%C A207673 For a guide to related sequences and conjectures, see A206911.
%t A207673 r = 5; s = GoldenRatio; t = 1/s;
%t A207673 a[n_] := n + Floor[n*s/r] + Floor[n*t/r];
%t A207673 b[n_] := n + Floor[n*r/s] + Floor[n*t/s];
%t A207673 c[n_] := n + Floor[n*r/t] + Floor[n*s/t];
%t A207673 Table[a[n], {n, 1, 60}] (* A207672 *)
%t A207673 Table[b[n], {n, 1, 60}] (* A207673 *)
%t A207673 Table[c[n], {n, 1, 60}] (* A208326 *)
%Y A207673 Cf. A206911, A207672, A208326.
%K A207673 nonn
%O A207673 1,1
%A A207673 _Clark Kimberling_, Feb 26 2012
%E A207673 Definition corrected by _Georg Fischer_, Jun 10 2020