OFFSET
0,1
COMMENTS
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
Clark Kimberling, Table of n, a(n) for n = 0..2000
J-P. Bode, H. Harborth, C. Kimberling, Complementary Fibonacci sequences, Fibonacci Quarterly 45 (2007), 254-264.
MATHEMATICA
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Feb 15 2018
STATUS
approved