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.
%I A294419 #9 Nov 01 2017 20:54:25 %S A294419 1,3,16,37,75,138,243,415,696,1153,1895,3098,5047,8203,13314,21587, %T A294419 34975,56640,91697,148423,240210,388727,629035,1017864,1647005, %U A294419 2664979,4312098,6977195,11289415,18266736,29556281,47823151,77379570,125202863,202582581 %N A294419 Solution of the complementary equation a(n) = a(n-1) + a(n-2) + 2*b(n-1) + 2*b(n-2), where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4. %C A294419 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 A294419 Conjecture: a(n)/a(n-1) -> (1 + sqrt(5))/2, the golden ratio. %H A294419 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 A294419 a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4, so that %e A294419 a(2) = a(1) + a(0) + 2*b(1) + 2*b(0) = 16 %e A294419 Complement: (b(n)) = (2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17,...) %t A294419 mex := First[Complement[Range[1, Max[#1] + 1], #1]] &; %t A294419 a[0] = 1; a[1] = 3; b[0] = 2; b[1] = 4; %t A294419 a[n_] := a[n] = a[n - 1] + a[n - 2] + 2 b[n - 1] + 2 b[n - 2]; %t A294419 b[n_] := b[n] = mex[Flatten[Table[Join[{a[n]}, {a[i], b[i]}], {i, 0, n - 1}]]]; %t A294419 Table[a[n], {n, 0, 40}] (* A294419 *) %t A294419 Table[b[n], {n, 0, 10}] %Y A294419 Cf. A293076, A293765, A294414. %K A294419 nonn,easy %O A294419 0,2 %A A294419 _Clark Kimberling_, Oct 31 2017