cp's OEIS Frontend

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

%I A299407 #10 Jan 05 2025 19:51:41
%S A299407 2,3,6,7,8,10,11,12,14,16,17,19,20,22,24,25,27,28,29,31,32,34,35,37,
%T A299407 38,40,41,43,44,45,47,48,50,51,53,54,56,58,59,61,62,64,65,67,68,70,71,
%U A299407 73,74,76,77,79,80,82,83,85,86,88,90,91,93,94,96,97,99,100
%N A299407 Solution b( ) of the complementary equation a(n) = b(n-1) + b(n-2), where a(0) = 1, a(1) = 4; see Comments.
%C A299407 a(n) = b(n-1) + b(n-2) for n > 2;
%C A299407 b(0) = least positive integer not in {a(0),a(1)};
%C A299407 b(n) = least positive integer not in {a(0),...,a(n),b(0),...b(n-1)} for n > 1.
%C A299407 Note that (b(n)) is strictly increasing and is the complement of (a(n)).
%C A299407 See A022424 for a guide to related sequences.
%H A299407 Clark Kimberling, <a href="/A299407/b299407.txt">Table of n, a(n) for n = 0..2000</a>
%H A299407 J-P. Bode, H. Harborth, C. Kimberling, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Papers1/45-3/bode.pdf">Complementary Fibonacci sequences</a>, Fibonacci Quarterly 45 (2007), 254-264.
%t A299407 mex := First[Complement[Range[1, Max[#1] + 1], #1]] &;
%t A299407 a[0] = 1; a[1] = 4; b[0] = 2; b[1] = 3;
%t A299407 a[n_] := a[n] = b[n - 1] + b[n - 2];
%t A299407 b[n_] := b[n] = mex[Flatten[Table[Join[{a[n]}, {a[i], b[i]}], {i, 0, n - 1}]]];
%t A299407 Table[a[n], {n, 0, 100}]  (* A022425 *)
%t A299407 Table[b[n], {n, 0, 100}]  (* A299407 *)
%Y A299407 Cf. A022424, A022425.
%K A299407 nonn,easy
%O A299407 0,1
%A A299407 _Clark Kimberling_, Feb 14 2018