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.

A294425 Solution of the complementary equation a(n) = a(n-1) + a(n-2) + 2*b(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, 9, 17, 32, 56, 96, 163, 270, 445, 728, 1187, 1930, 3133, 5082, 8234, 13336, 21591, 34949, 56563, 91536, 148124, 239686, 387837, 627551, 1015417, 1642998, 2658446, 4301478, 6959958, 11261471, 18221465, 29482973, 47704476, 77187488, 124892004, 202079533
Offset: 0

Views

Author

Clark Kimberling, Nov 01 2017

Keywords

Comments

The complementary sequences a() and b() are uniquely determined by the titular equation and initial values. See A294414 for a guide to related sequences.
Conjecture: a(n)/a(n-1) -> (1 + sqrt(5))/2, the golden ratio.

Examples

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

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] + a[n - 2] + 2*b[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}]  (* A294425 *)
    Table[b[n], {n, 0, 10}]