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.

Showing 1-2 of 2 results.

A130759 Partial sums of A130707.

Original entry on oeis.org

1, 3, 5, 7, 11, 21, 43, 87, 173, 343, 683, 1365, 2731, 5463, 10925, 21847, 43691, 87381, 174763, 349527, 699053, 1398103, 2796203, 5592405, 11184811, 22369623, 44739245, 89478487, 178956971, 357913941, 715827883, 1431655767, 2863311533
Offset: 0

Views

Author

Paul Curtz, Jul 13 2007

Keywords

Programs

Extensions

Better definition and more terms from R. J. Mathar, Oct 28 2007

A131562 a(n)= -3a(n-1) -3a(n-2)-2a(n-3), a(0)=1, a(1)=-2, a(2)=2.

Original entry on oeis.org

1, -2, 2, -2, 4, -10, 22, -44, 86, -170, 340, -682, 1366, -2732, 5462, -10922, 21844, -43690, 87382, -174764, 349526, -699050, 1398100, -2796202, 5592406, -11184812, 22369622, -44739242, 89478484, -178956970, 357913942, -715827884, 1431655766, -2863311530
Offset: 0

Views

Author

Paul Curtz, Aug 27 2007

Keywords

Crossrefs

Cf. A130707.

Programs

  • Mathematica
    LinearRecurrence[{-3,-3,-2},{1,-2,2},40] (* Harvey P. Dale, Jan 11 2017 *)

Formula

|v(n)| = 2^n+A130772(n); 2*|v(n)|-|v(n+1)|= 2*A057079(n), where v(n)=a(n+1)-a(n) are first differences.
O.g.f.: (1+x-x^2)/((1+2*x)*(1+x+x^2)). a(n)=(-1)^n*A130707(n). - R. J. Mathar, Jul 07 2008
Binomial transform yields A130151 without the first two terms. - R. J. Mathar, Jul 07 2008

Extensions

Edited by R. J. Mathar, Jul 07 2008
Showing 1-2 of 2 results.