cp's OEIS Frontend

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

%I A296267 #6 Dec 12 2017 16:37:36
%S A296267 1,3,14,41,90,179,332,591,1022,1733,2898,4811,7917,12983,21188,34494,
%T A296267 56042,90935,147417,238835,386780,626190,1013594,1640459,2654781,
%U A296267 4296023,6951644,11248566,18201170,29450759,47653017,77104931,124759172,201865398,326625938
%N A296267 Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-2)*b(n), where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences.
%C A296267 The increasing complementary sequences a() and b() are uniquely determined by the titular equation and initial values. a(n)/a(n-1) -> (1 + sqrt(5))/2 = golden ratio (A001622). See A296245 for a guide to related sequences.
%H A296267 Clark Kimberling, <a href="/A296267/b296267.txt">Table of n, a(n) for n = 0..1000</a>
%H A296267 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 A296267 a(0) = 1, a(1) = 3, b(0) = 3, b(1) = 2, b(2) = 4, b(3) = 5;
%e A296267 a(2) = a(0) + a(1) + b(0)*b(2) = 14;
%e A296267 Complement: (b(n)) = (2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 16, ...)
%t A296267 a[0] = 1; a[1] = 3; b[0] = 2; b[1] = 4; b[2] = 5;
%t A296267 a[n_] := a[n] = a[n - 1] + a[n - 2] + b[n - 2] b[n];
%t A296267 j = 1; While[j < 10, k = a[j] - j - 1;
%t A296267 While[k < a[j + 1] - j + 1, b[k] = j + k + 2; k++]; j++];
%t A296267 Table[a[n], {n, 0, k}];  (* A296267 *)
%t A296267 Table[b[n], {n, 0, 20}]  (* complement *)
%Y A296267 Cf. A001622, A296245.
%K A296267 nonn,easy
%O A296267 0,2
%A A296267 _Clark Kimberling_, Dec 12 2017