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.

A295144 Solution of the complementary equation a(n) = 2*a(n-1) + a(n-2) + b(n-1), where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4, and (a(n)) and (b(n)) are increasing complementary sequences.

This page as a plain text file.
%I A295144 #4 Nov 19 2017 19:05:52
%S A295144 1,3,11,30,77,191,467,1134,2745,6636,16030,38710,93465,225656,544794,
%T A295144 1315262,3175337,7665956,18507270,44680518,107868329,260417200,
%U A295144 628702754
%N A295144 Solution of the complementary equation a(n) = 2*a(n-1) + a(n-2) + b(n-1), where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4, and (a(n)) and (b(n)) are increasing complementary sequences.
%C A295144 The increasing complementary sequences a() and b() are uniquely determined by the titular equation and initial values. See A295053 for a guide to related sequences.
%H A295144 Clark Kimberling, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL10/Kimberling/kimberling26.html">Complementary equations</a>, J. Int. Seq. 19 (2007), 1-13.
%F A295144 a(n+1)/a(n) -> 1 + sqrt(2).
%e A295144 a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4
%e A295144 a(2) =2*a(1) + a(0) + b(1) = 11
%e A295144 Complement: (b(n)) = (2, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, ...)
%t A295144 mex := First[Complement[Range[1, Max[#1] + 1], #1]] &;
%t A295144 a[0] = 1; a[1] = 3; b[0] = 2; b[1] = 4;
%t A295144 a[n_] := a[n] = 2 a[ n - 1] + a[n - 2] + b[n - 1];
%t A295144 b[n_] := b[n] = mex[Flatten[Table[Join[{a[n]}, {a[i], b[i]}], {i, 0, n - 1}]]];
%t A295144 Table[a[n], {n, 0, 18}]  (* A295144 *)
%t A295144 Table[b[n], {n, 0, 10}]
%Y A295144 Cf. A295053, A295141, A295142, A295143.
%K A295144 nonn,easy
%O A295144 0,2
%A A295144 _Clark Kimberling_, Nov 19 2017