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.

A139763 a(n)=a(n-1)+a(n-2)+a(n-3)+2a(n-4) with a(n)=n+1 for n<=3.

Original entry on oeis.org

1, 2, 3, 4, 11, 22, 43, 84, 171, 342, 683, 1364, 2731, 5462, 10923, 21844, 43691, 87382, 174763, 349524, 699051, 1398102, 2796203, 5592404, 11184811, 22369622
Offset: 0

Views

Author

Paul Curtz, May 20 2008

Keywords

Programs

  • Mathematica
    LinearRecurrence[{1,1,1,2},{1,2,3,4},30] (* Harvey P. Dale, May 22 2021 *)

Formula

a(n+1)-2a(n)=period 4:repeat 0, -1, -2, 3.
O.g.f.: (x-1)*(2*x^2+2*x+1)/((2*x-1)(1+x)(x^2+1)). a(n) = A056594(n+3)+((-1)^n+2^(n+1))/3. - R. J. Mathar, May 22 2008

Extensions

More terms from R. J. Mathar, May 22 2008