OFFSET
0,2
COMMENTS
From 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)).
***
In the following guide to solutions a( ) and b( ) of a(n) = b(n-1) + b(n-2), an asterisk (*) indicates that a( ) differs from the indicated A-sequence in one or two initial terms:
(a(n)) (b(n)) a(0) a(1)
***
Guide to solutions a( ) and b( ) of a(n) = b(n-1) + b(n-2) + b(n-3) for various initial values:
(a(n)) (b(n)) a(0) a(1) a(2)
***
Guide to other complementary equations:
A299547: a(n) = b(n-1) + b(n-2) + ... + b(0), a(0) = 1, a(1) = 2, a(2) = 3
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}]]] &, {1, 2}, Range[56]] (* Ivan Neretin, Mar 28 2017 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
EXTENSIONS
Edited by Clark Kimberling, Feb 16 2018
STATUS
approved