cp's OEIS Frontend

A294861 Solution of the complementary equation a(n) = a(n-2) + b(n-2) + 1, where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.

%I A294861 #4 Nov 18 2017 09:05:41
%S A294861 1,2,5,7,12,16,22,27,34,41,49,57,67,76,87,97,109,121,134,147,161,176,
%T A294861 191,207,223,240,257,276,294,314,333,354,374,397,418,442,464,489,512,
%U A294861 538,563,590,616,644,671,700,728,759,788,820,850,883,914,948,980
%N A294861 Solution of the complementary equation a(n) = a(n-2) + b(n-2) + 1, where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.
%C A294861 The increasing complementary sequences a() and b() are uniquely determined by the titular equation and initial values. See A294860 for a guide to related sequences.
%H A294861 Clark Kimberling, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL10/Kimberling/kimberling26.html">Complementary equations</a>, J. Int. Seq. 19 (2007), 1-13.
%e A294861 a(0) = 1, a(1) = 2, b(0) = 3
%e A294861 b(1) = 4 (least "new number")
%e A294861 a(2) = a(0) + b(0) + 1 = 5
%e A294861 Complement: (b(n)) = (3, 4, 6, 8, 9, 10, 11, 12, 14, 15, 17, ...)
%t A294861 mex := First[Complement[Range[1, Max[#1] + 1], #1]] &;
%t A294861 a[0] = 1; a[1] = 2; b[0] = 3;
%t A294861 a[n_] := a[n] = a[n - 2] + b[n - 2] + 1;
%t A294861 b[n_] := b[n] = mex[Flatten[Table[Join[{a[n]}, {a[i], b[i]}], {i, 0, n - 1}]]];
%t A294861 Table[a[n], {n, 0, 18}]  (* A294861 *)
%t A294861 Table[b[n], {n, 0, 10}]
%Y A294861 Cf. A294860, A294862.
%K A294861 nonn,easy
%O A294861 0,2
%A A294861 _Clark Kimberling_, Nov 16 2017