A296271 - OEIS

%I #6 Dec 12 2017 16:38:03

%S 3,4,12,28,75,151,289,520,908,1558,2620,4373,7217,11845,19350,31518,

%T 51228,83145,134813,218441,353782,572798,927204,1500677,2428635,

%U 3930122,6359656,10290738,16651417,26943243,43595815,70540282,114137392,184679042,298817877

%N Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-2)*b(n), where a(0) = 3, a(1) = 4, b(0) = 1, b(1) = 2, 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="/A296271/b296271.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) = 3, a(1) = 4, b(0) = 1, b(1) = 2, b(2) = 5;

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

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

%t a[0] = 3; a[1] = 4; b[0] = 1; b[1] = 2; 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}];  (* A296271 *)

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

%Y Cf. A001622, A296245.

%K nonn,easy

%O 0,1

%A _Clark Kimberling_, Dec 12 2017