cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A294426 #5 Nov 01 2017 12:26:46
%S A294426 1,3,8,15,28,49,86,144,240,395,647,1055,1718,2789,4524,7331,11874,
%T A294426 19225,31120,50367,81510,131901,213436,345363,558828,904220,1463078,
%U A294426 2367329,3830439,6197801,10028274,16226110,26254420,42480567,68735025,111215631,179950696
%N A294426 Solution of the complementary equation a(n) = a(n-1) + a(n-2) + 2*b(n-1) - b(n-2) - 2, where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4.
%C A294426 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 A294426 Conjecture: a(n)/a(n-1) -> (1 + sqrt(5))/2, the golden ratio.
%H A294426 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 A294426 a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4, so that
%e A294426 a(2)  = a(1) + a(0) + 2*b(1) - b(0) - 2 = 8
%e A294426 Complement: (b(n)) = (2, 4, 5, 6, 7, 9, 10, 11, 12, 13, 14, 16,...)
%t A294426 mex := First[Complement[Range[1, Max[#1] + 1], #1]] &;
%t A294426 a[0] = 1; a[1] = 3; b[0] = 2; b[1] = 4;
%t A294426 a[n_] := a[n] = a[n - 1] + a[n - 2] + 2*b[n - 1] - b[n - 2] - 2;
%t A294426 b[n_] := b[n] = mex[Flatten[Table[Join[{a[n]}, {a[i], b[i]}], {i, 0, n - 1}]]];
%t A294426 Table[a[n], {n, 0, 40}]  (* A294426 *)
%t A294426 Table[b[n], {n, 0, 10}]
%Y A294426 Cf. A293076, A293765, A294414.
%K A294426 nonn,easy
%O A294426 0,2
%A A294426 _Clark Kimberling_, Nov 01 2017