OFFSET
0,2
COMMENTS
a(n) = b(n-1) + b(n-2) + b(n-3) for n > 2;
b(0) = least positive integer not in {a(0),a(1),a(2)};
b(n) = least positive integer not in {a(0),...,a(n),b(0),...b(n-1)} for n > 1.
Note that (b(n)) is strictly increasing and is the complement of (a(n)).
See A022424 for a guide to related sequences.
LINKS
Clark Kimberling, Table of n, a(n) for n = 0..1000
J-P. Bode, H. Harborth, C. Kimberling, Complementary Fibonacci sequences, Fibonacci Quarterly 45 (2007), 254-264.
MATHEMATICA
mex := First[Complement[Range[1, Max[#1] + 1], #1]] &;
a[0] = 1; a[1] = 2; a[2] = 4; b[0] = 3; b[1] = 5; b[2] = 6;
a[n_] := a[n] = b[n - 1] + b[n - 2] + b[n - 3];
b[n_] := b[n] = mex[Flatten[Table[Join[{a[n]}, {a[i], b[i]}], {i, 0, n - 1}]]];
Table[a[n], {n, 0, 100}] (* A299488 *)
Table[b[n], {n, 0, 100}] (* A299489 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Feb 16 2018
STATUS
approved