OFFSET
0,2
COMMENTS
Define complementary sequences a(n) and b(n) recursively:
b(n) = least new,
a(n) = b(2n) + b(3n),
where "least new" means the least positive integer not yet placed. Empirically, {a(n) - 6*n: n >= 0} = {2,3} and {5*b(n) - 6*n: n >= 0} = {4,5,6,7,8,9}. See A304799 for a guide to related sequences.
LINKS
Clark Kimberling, Table of n, a(n) for n = 0..10000
EXAMPLE
b(0) = 1, so that a(0) = 2. Since a(1) = b(2) + b(3), we must have a(1) >= 7, so that b(1) = 3, b(2) = 4, b(3) = 5, b(4) = 6, and a(1) = 9.
MATHEMATICA
mex[list_, start_] := (NestWhile[# + 1 &, start, MemberQ[list, #] &]);
h = 2; k = 3; a = {}; b = {1};
AppendTo[a, mex[Flatten[{a, b}], 1]];
Do[Do[AppendTo[b, mex[Flatten[{a, b}], Last[b]]], {k}];
AppendTo[a, Last[b] + b[[1 + (Length[b] - 1)/k h]]], {500}];
Take[a, 200] (* A304807 *)
Take[b, 200] (* A304808 *)
(* Peter J. C. Moses, May 14 2008 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, May 28 2018
STATUS
approved