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 A045775 #19 Oct 25 2014 13:27:08
%S A045775 0,5,10,15,20,28,33,38,43,51,56,61,66,74,79,84,89,97,102,107,112,117,
%T A045775 122,127,135,140,145,150,158,163,168,173,181,186,191,196,204,209,214,
%U A045775 219,224,229,234,242,247,252,257,265,270,275,280,288,293,298,303
%N A045775 Extension of Beatty sequence; complement of A045774.
%C A045775 (s,t)-sequences; the case s=3, t=2.
%D A045775 Clark Kimberling, Complementary Equations, Journal of Integer Sequences, Vol. 10 (2007), Article 07.1.4.
%H A045775 A. S. Fraenkel, <a href="http://arXiv.org/abs/math.CO/9809074">Heap games, numeration systems and sequences</a>, Annals of Combinatorics, 2 (1998), 197-210.
%H A045775 Wen An Liu and Xiao Zhao, <a href="http://dx.doi.org/10.1016/j.dam.2014.08.009">Adjoining to (s,t)-Wythoff's game its P-positions as moves</a>, Discrete Applied Mathematics, 27 August 2014; see Table 5.
%H A045775 <a href="/index/Be#Beatty">Index entries for sequences related to Beatty sequences</a>
%F A045775 a(n) = 3*A045774(n)+2*n.
%t A045775 s=3; t=2;
%t A045775 mex:=First[Complement[Range[1,Max[#1]+1],#1]]&;
%t A045775 a[0]=0; b[n_]:=b[n]=s*a[n]+t*n;
%t A045775 a[n_]:=a[n]=mex[Flatten[Table[{a[i],b[i]},{i,0,n-1}]]];
%t A045775 Table[a[n],{n,200}] (* A045774 *)
%t A045775 Table[b[n],{n,200}] (* A045775 *)
%t A045775 (* From _Clark Kimberling_, Apr 02 2011 *)
%Y A045775 Cf. A045749, A045750.
%K A045775 nonn
%O A045775 0,2
%A A045775 _Aviezri S. Fraenkel_