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.

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

This page as a plain text file.
%I A295138 #4 Nov 19 2017 19:05:02
%S A295138 1,2,7,11,27,41,90,133,282,412,860,1251,2596,3770,7806,11329,23438,
%T A295138 34008,70336,102047,211032,306166,633122,918526,1899395,2755608,
%U A295138 5698216,8266856,17094681,24800602,51284078,74401842
%N A295138 Solution of the complementary equation a(n) = 3*a(n-2) + b(n-1), where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.
%C A295138 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.
%C A295138 The sequence a(n+1)/a(n) appears to have two convergent subsequences, with limits 1.45..., 2.06...
%H A295138 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 A295138 a(0) = 1, a(1) = 2, b(0) = 3
%e A295138 a(2) =3*a(0) + b(1) = 7
%e A295138 Complement: (b(n)) = (3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 14, ... )
%t A295138 mex := First[Complement[Range[1, Max[#1] + 1], #1]] &;
%t A295138 a[0] = 1; a[1] = 2; b[0] = 3;
%t A295138 a[n_] := a[n] = 3 a[n - 2] + b[n - 1];
%t A295138 b[n_] := b[n] = mex[Flatten[Table[Join[{a[n]}, {a[i], b[i]}], {i, 0, n - 1}]]];
%t A295138 Table[a[n], {n, 0, 18}]  (* A295138 *)
%t A295138 Table[b[n], {n, 0, 10}]
%Y A295138 Cf. A295053.
%K A295138 nonn,easy
%O A295138 0,2
%A A295138 _Clark Kimberling_, Nov 19 2017