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 A045682 #18 Feb 12 2014 18:14:38
%S A045682 0,5,10,15,20,27,32,37,42,49,54,59,64,71,76,81,86,93,98,103,108,113,
%T A045682 118,125,130,135,140,147,152,157,162,169,174,179,184,191,196,201,206,
%U A045682 211,216,223,228,233,238,245,250,255,260,267,272,277,282,289,294,299
%N A045682 Extension of Beatty sequence; complement of A045681.
%C A045682 (s,t)-sequences; the case s=2, t=3.
%H A045682 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 A045682 <a href="/index/Be#Beatty">Index entries for sequences related to Beatty sequences</a>
%F A045682 a(n) = 2*A045681(n)+3*n.
%t A045682 s=2; t=3;
%t A045682 mex:=First[Complement[Range[1,Max[#1]+1],#1]]&;
%t A045682 a[0]=0; b[n_]:=b[n]=s*a[n]+t*n;
%t A045682 a[n_]:=a[n]=mex[Flatten[Table[{a[i],b[i]},{i,0,n-1}]]];
%t A045682 Table[a[n],{n,200}] (* A045681 *)
%t A045682 Table[b[n],{n,200}] (* A045682 *)
%t A045682 (* From _Clark Kimberling_, Apr 02 2011 *)
%Y A045682 Cf. A045671, A045672.
%K A045682 nonn
%O A045682 0,2
%A A045682 _Aviezri S. Fraenkel_