OFFSET
0,1
COMMENTS
Following the Bode-Harborth-Kimberling link:
a(n) = b(n-1) + b(n-2) for n > 2;
b(0) = least positive integer not in {a(0),a(1)};
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
Ivan Neretin, Table of n, a(n) for n = 0..10000
J-P. Bode, H. Harborth, C. Kimberling, Complementary Fibonacci sequences, Fibonacci Quarterly 45 (2007), 254-264.
MATHEMATICA
Fold[Append[#1, Plus @@ Complement[Range[Max@#1 + 3], #1][[{#2, #2 + 1}]]] &, {2, 3}, Range[44]] (* Ivan Neretin, Mar 28 2017 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
STATUS
approved