cp's OEIS Frontend

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

%I A294548 #8 Nov 14 2017 22:19:40
%S A294548 1,2,8,17,34,62,110,188,316,524,862,1410,2298,3736,6065,9834,15934,
%T A294548 25805,41778,67624,109445,177114,286606,463769,750426,1214248,1964729,
%U A294548 3179034,5143822,8322917,13466803,21789786,35256657,57046513,92303242,149349829
%N A294548 Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1) + n - 1, where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.
%C A294548 The increasing complementary sequences a() and b() are uniquely determined by the titular equation and initial values. See A294532 for a guide to related sequences. Conjecture: a(n)/a(n-1) -> (1 + sqrt(5))/2 = golden ratio (A001622).
%H A294548 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 A294548 a(0) = 1, a(1) = 2, b(0) = 3, so that
%e A294548 b(1) = 4 (least "new number");
%e A294548 a(2) = a(1) + a(0) + b(1) + 1 = 8.
%e A294548 Complement: (b(n)) = (3, 4, 5, 6, 7, 9, 10, 12, 13, 14, 15, 16, 18, ...).
%t A294548 mex := First[Complement[Range[1, Max[#1] + 1], #1]] &;
%t A294548 a[0] = 1; a[1] = 3; b[0] = 2;
%t A294548 a[n_] := a[n] = a[n - 1] + a[n - 2] + b[n - 1] + n - 1;
%t A294548 b[n_] := b[n] = mex[Flatten[Table[Join[{a[n]}, {a[i], b[i]}], {i, 0, n - 1}]]];
%t A294548 Table[a[n], {n, 0, 40}]  (* A294548 *)
%t A294548 Table[b[n], {n, 0, 10}]
%Y A294548 Cf. A001622, A294532.
%K A294548 nonn,easy
%O A294548 0,2
%A A294548 _Clark Kimberling_, Nov 04 2017