OFFSET
0,3
COMMENTS
(s,t)-sequences; the case s=3, t=2.
LINKS
A. S. Fraenkel, Heap games, numeration systems and sequences, arXiv:math/9809074 [math.CO], 1998; Annals of Combinatorics, 2 (1998), 197-210.
Clark Kimberling, Complementary equations, J. Int. Seq. 19 (2007), 1-13.
Wen An Liu and Xiao Zhao, Adjoining to (s,t)-Wythoff's game its P-positions as moves, Discrete Applied Mathematics, 179 (2014), 28-43. See Table 5.
FORMULA
a(n)=mex {a(i), b(i):0 <= i<n}, where b=A045775, mex S=least integer >= 0 not in the sequence S.
MATHEMATICA
s=3; t=2;
mex:=First[Complement[Range[1, Max[#1]+1], #1]]&;
a[0]=0; b[n_]:=b[n]=s*a[n]+t*n;
a[n_]:=a[n]=mex[Flatten[Table[{a[i], b[i]}, {i, 0, n-1}]]];
Table[a[n], {n, 200}] (* A045774 *)
Table[b[n], {n, 200}] (* A045775 *)
(* Clark Kimberling, Apr 02 2011 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
STATUS
approved