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-1) + b(n-2) - n, where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4.
2

%I #9 Nov 01 2017 20:54:13

%S 1,3,8,17,32,57,99,168,280,462,757,1235,2009,3262,5291,8575,13889,

%T 22488,36402,58916,95345,154289,249663,403982,653676,1057690,1711399,

%U 2769123,4480558,7249719,11730316,18980075,30710432,49690549,80401024,130091617

%N Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1) + b(n-2) - n, where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4.

%C The complementary sequences a() and b() are uniquely determined by the titular equation and initial values. See A294414 for a guide to related sequences.

%C Conjecture: a(n)/a(n-1) -> (1 + sqrt(5))/2, the golden ratio.

%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) = 2, b(1) = 4, so that

%e a(2) = a(1) + a(0) + b(1) + b(0) - 2 = 8

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

%t mex := First[Complement[Range[1, Max[#1] + 1], #1]] &;

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

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

%t b[n_] := b[n] = mex[Flatten[Table[Join[{a[n]}, {a[i], b[i]}], {i, 0, n - 1}]]];

%t Table[a[n], {n, 0, 40}] (* A294417 *)

%t Table[b[n], {n, 0, 10}]

%Y Cf. A293076, A293765, A294414.

%K nonn,easy

%O 0,2

%A _Clark Kimberling_, Oct 31 2017