A299417 - OEIS

A299417

Solution b( ) of the complementary equation a(n) = b(n-1) + b(n-2), where a(0) = 3, a(1) = 4; see Comments.

1, 2, 5, 6, 8, 9, 10, 12, 13, 15, 16, 18, 20, 21, 23, 24, 26, 27, 29, 30, 32, 33, 35, 36, 37, 39, 40, 42, 43, 45, 46, 48, 49, 51, 52, 54, 55, 57, 58, 60, 61, 63, 64, 66, 67, 69, 70, 72, 74, 75, 77, 78, 80, 81, 83, 84, 86, 87, 89, 90, 92, 93, 95, 96, 98, 99

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,2

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.