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 A208326 #6 Mar 30 2012 18:58:13
%S A208326 11,23,34,46,58,69,81,92,104,116,127,140,152,163,175,186,198,210,221,
%T A208326 233,244,256,269,280,292,304,315,327,338,350,362,373,385,398,409,421,
%U A208326 432,444,456,467,479,490,502,514,526,538,550,561,573,584,596
%N A208326 n + [nr/t] + [ns/t], where []=floor, r=5, s=(1+sqrt(5))/2, t=1/s.
%C A208326 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 A208326 For a guide to related sequences and conjectures, see A206911.
%t A208326 r = 5; s = GoldenRatio; t = 1/s;
%t A208326 a[n_] := n + Floor[n*s/r] + Floor[n*t/r];
%t A208326 b[n_] := n + Floor[n*r/s] + Floor[n*t/s];
%t A208326 c[n_] := n + Floor[n*r/t] + Floor[n*s/t];
%t A208326 Table[a[n], {n, 1, 60}] (* A207672 *)
%t A208326 Table[b[n], {n, 1, 60}] (* A207673 *)
%t A208326 Table[c[n], {n, 1, 60}] (* A208326 *)
%Y A208326 Cf. A206911, A207672, A207673.
%K A208326 nonn
%O A208326 1,1
%A A208326 _Clark Kimberling_, Feb 26 2012