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.

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

This page as a plain text file.
%I A296000 #18 Sep 23 2020 10:51:02
%S A296000 1,3,10,37,135,493,1800,6572,23996,87614,319895,1167997,4264577,
%T A296000 15570774,56851829,207576737,757901769,2767242128,10103722287,
%U A296000 36890593353,134694505577,491795012865,1795636233585,6556206140806,23937943641806,87401941533192
%N A296000 Solution of the complementary equation a(n) = a(0)*b(n-1) + a(1)*b(n-2) + ... + a(n-1)*b(0), where a(0) = 1, a(1) = 3, b(0) = 2, and (a(n)) and (b(n)) are increasing complementary sequences.
%C A296000 The increasing complementary sequences a() and b() are uniquely determined by the titular equation and initial values.  a(n)/a(n-1) -> 3.651188... (as in A295999).  Guide for the complementary equation a(n) = a(0)*b(n-1) + a(1)*b(n-2) + ... + a(n-1)*b(0):
%C A296000 A296000: a(0) = 1, a(1) = 3, b(0) = 2, limiting ratio of a(n)/a(n-1): A295999
%C A296000 A296001: a(0) = 1, a(1) = 2, b(0) = 3, limiting ratio of a(n)/a(n-1): A296002
%C A296000 A296003: a(0) = 2, a(1) = 4, b(0) = 1, limiting ratio of a(n)/a(n-1): A296004
%C A296000 A296005: a(0) = 2, a(1) = 3, b(0) = 1, limiting ratio of a(n)/a(n-1): A296006
%H A296000 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 A296000 a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4, so that
%e A296000 a(2) = a(0)*b(1) + a(1)*b(0) = 10
%e A296000 Complement: (b(n)) = (2, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, ...)
%t A296000 $RecursionLimit = Infinity;
%t A296000 mex[list_] := NestWhile[# + 1 &, 1, MemberQ[list, #] &];
%t A296000 a[0] = 1; a[1] = 3; b[0] = 2; a[n_] := a[n] = Sum[a[k]*b[n - k - 1], {k, 0, n - 1}];
%t A296000 b[n_] := b[n] = mex[Flatten[Table[Join[{a[n]}, {a[i], b[i]}], {i, 0, n - 1}]]];
%t A296000 Table[a[n], {n, 0, 100}]  (* A296000 *)
%t A296000 t = N[Table[a[n]/a[n - 1], {n, 1, 500, 100}], 200]
%t A296000 Take[RealDigits[Last[t], 10][[1]], 100]  (* A295999 *)
%Y A296000 Cf. A295999, A296001.
%K A296000 nonn,easy
%O A296000 0,2
%A A296000 _Clark Kimberling_, Dec 04 2017
%E A296000 Incorrect conjectured g.f. removed by _Georg Fischer_, Sep 23 2020