OFFSET
0,1
COMMENTS
Define sequences a(n), b(n), c(n) recursively, starting with a(0) = 1:
a(n) = least new,
b(n) = least new,
c(n) = 2*a(n) + b(n),
where "least new k" means the least positive integer not yet placed. The three sequences partition the positive integers. Empirically:
1 <= 3*a(n) - 7*n <= 5,
5 <= 3*b(n) - 7*n <= 8,
3 <= c(n) - 7*n <= 6.
EXAMPLE
a(0) = 1, b(0) = 2; c(0) = 2*1 + 2 = 4, so that a(1) = 3, so that b(1) = 4, so that c(1) = 11.
MATHEMATICA
z = 300;
mex[list_, start_] := (NestWhile[# + 1 &, start, MemberQ[list, #] &]);
a = {}; b = {}; c = {};
Do[AppendTo[a,
mex[Flatten[{a, b, c}], If[Length[a] == 0, 1, Last[a]]]];
AppendTo[b, mex[Flatten[{a, b, c}], Last[a]]];
AppendTo[c, 2 Last[a] + Last[b]], {z}];
Take[a, 100] (* A304497 *)
Take[b, 100] (* A304498 *)
Take[c, 100] (* A304499 *)
Grid[{Join[{"n"}, Range[0, 20]], Join[{"a(n)"}, Take[a, 21]],
Join[{"b(n)"}, Take[b, 21]], Join[{"c(n)"}, Take[c, 21]]},
Alignment -> ".", Dividers -> {{2 -> Red, -1 -> Blue}, {2 -> Red, -1 -> Blue}}]
(* Peter J. C. Moses, Apr 26 2018 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, May 16 2018
STATUS
approved