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 A207672 #5 Mar 30 2012 18:58:13
%S A207672 1,2,3,5,6,7,9,10,12,14,15,16,18,19,20,22,24,25,27,28,29,31,32,33,36,
%T A207672 37,38,40,41,42,44,45,47,49,50,51,52,54,55,56,59,60,61,63,64,65,67,68,
%U A207672 70,72,73,74,76,77,78,80,82,83,85,86,87,89,90,91,94,95,96,98
%N A207672 n + [ns/r] + [nt/r], where []=floor, r=5, s=(1+sqrt(5))/2, t=1/s.
%C A207672 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 A207672 For a guide to related sequences and a conjecture, see A206911.
%t A207672 r = 5; s = GoldenRatio; t = 1/s;
%t A207672 a[n_] := n + Floor[n*s/r] + Floor[n*t/r];
%t A207672 b[n_] := n + Floor[n*r/s] + Floor[n*t/s];
%t A207672 c[n_] := n + Floor[n*r/t] + Floor[n*s/t];
%t A207672 Table[a[n], {n, 1, 60}] (* A207672 *)
%t A207672 Table[b[n], {n, 1, 60}] (* A207673 *)
%t A207672 Table[c[n], {n, 1, 60}] (* A208326 *)
%Y A207672 Cf. A206911, A207673, A208326.
%K A207672 nonn
%O A207672 1,2
%A A207672 _Clark Kimberling_, Feb 26 2012