login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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.
2

%I #6 Dec 12 2017 16:37:36

%S 1,3,14,41,90,179,332,591,1022,1733,2898,4811,7917,12983,21188,34494,

%T 56042,90935,147417,238835,386780,626190,1013594,1640459,2654781,

%U 4296023,6951644,11248566,18201170,29450759,47653017,77104931,124759172,201865398,326625938

%N 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 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 Clark Kimberling, <a href="/A296267/b296267.txt">Table of n, a(n) for n = 0..1000</a>

%H 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 a(0) = 1, a(1) = 3, b(0) = 3, b(1) = 2, b(2) = 4, b(3) = 5;

%e a(2) = a(0) + a(1) + b(0)*b(2) = 14;

%e Complement: (b(n)) = (2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 16, ...)

%t a[0] = 1; a[1] = 3; b[0] = 2; b[1] = 4; b[2] = 5;

%t a[n_] := a[n] = a[n - 1] + a[n - 2] + b[n - 2] b[n];

%t j = 1; While[j < 10, k = a[j] - j - 1;

%t While[k < a[j + 1] - j + 1, b[k] = j + k + 2; k++]; j++];

%t Table[a[n], {n, 0, k}]; (* A296267 *)

%t Table[b[n], {n, 0, 20}] (* complement *)

%Y Cf. A001622, A296245.

%K nonn,easy

%O 0,2

%A _Clark Kimberling_, Dec 12 2017