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.

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

Original entry on oeis.org

1, 3, 7, 29, 146, 877, 7017, 63154, 631541, 6946952, 83363425, 1083724526, 15172143365
Offset: 0

Views

Author

Clark Kimberling, Oct 29 2017

Keywords

Comments

The complementary sequences a() and b() are uniquely determined by the titular equation and initial values. See A294381 for a guide to related sequences.

Examples

			a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4, so that
a(2)  = a(1)*b(0) + 1 = 7
Complement: (b(n)) = (2, 4, 5, 6, 8, 9, 10, 12, 13, 14, 15, 16, ...)
		

Crossrefs

Programs

  • Mathematica
    mex := First[Complement[Range[1, Max[#1] + 1], #1]] &;
    a[0] = 1; a[1] = 3; b[0] = 2; b[1] = 4;
    a[n_] := a[n] = a[n - 1]*b[n - 2] + 1;
    b[n_] := b[n] = mex[Flatten[Table[Join[{a[n]}, {a[i], b[i]}], {i, 0, n - 1}]]];
    Table[a[n], {n, 0, 40}]  (* A294383 *)
    Table[b[n], {n, 0, 10}]