|
%I #6 Dec 12 2017 16:37:14
%S 2,4,9,28,67,137,260,477,847,1456,2459,4097,6766,11103,18141,29550,
%T 48033,77963,126416,204841,331763,537156,869519,1407325,2277546,
%U 3685654,5964070,9650654,15615716,25267426,40884264,66152880,107038404,173192616,280232426
%N Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-2)*b(n-1), where a(0) = 2, a(1) = 4, b(0) = 1, b(1) = 3, 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="/A296264/b296264.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) = 2, a(1) = 4, b(0) = 2, b(1) = 1, b(2) = 3;
%e a(2) = a(0) + a(1) + b(0)*b(1) = 9;
%e Complement: (b(n)) = (1, 3, 5, 6, 7, 8, 10, 11, 12, 13, 14, 15, 16, 17, ...)
%t a[0] = 2; a[1] = 4; b[0] = 1; b[1] = 3;
%t a[n_] := a[n] = a[n - 1] + a[n - 2] + b[n - 1] b[n - 2];
%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 u = Table[a[n], {n, 0, k}]; (* A296264 *)
%t Table[b[n], {n, 0, 20}] (* complement *)
%Y Cf. A001622, A296245.
%K nonn,easy
%O 0,1
%A _Clark Kimberling_, Dec 12 2017
|
