[go: up one dir, main page]

login
A299541
Solution a( ) of the complementary equation a(n) = b(n-1) + b(n-3), where a(0) = 2, a(1) = 4, a(2) = 6; see Comments.
3
2, 4, 6, 6, 10, 13, 16, 19, 21, 25, 27, 31, 33, 37, 40, 43, 46, 49, 52, 55, 58, 61, 64, 67, 70, 73, 75, 79, 81, 85, 87, 91, 93, 97, 99, 103, 105, 109, 111, 115, 117, 121, 123, 127, 129, 133, 135, 139, 141, 145, 148, 151, 154, 157, 160, 163, 166, 169, 172
OFFSET
0,1
COMMENTS
From the Bode-Harborth-Kimberling link:
a(n) = b(n-1) + b(n-3) for n > 3;
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
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] = 2; a[1] = 4; a[2] = 6; b[0] = 1; b[1] = 3;
a[n_] := a[n] = b[n - 1] + 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}] (* A299541 *)
Table[b[n], {n, 0, 100}] (* A299542 *)
CROSSREFS
Sequence in context: A254734 A254733 A254732 * A066820 A309796 A359671
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Feb 25 2018
STATUS
approved