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.

A168379 a(n) = 4*n - 2*(-1)^n + 1.

Original entry on oeis.org

7, 7, 15, 15, 23, 23, 31, 31, 39, 39, 47, 47, 55, 55, 63, 63, 71, 71, 79, 79, 87, 87, 95, 95, 103, 103, 111, 111, 119, 119, 127, 127, 135, 135, 143, 143, 151, 151, 159, 159, 167, 167, 175, 175, 183, 183, 191, 191, 199, 199, 207, 207, 215, 215, 223, 223, 231, 231
Offset: 1

Views

Author

Vincenzo Librandi, Nov 24 2009

Keywords

Programs

Formula

a(n) = 8*n - a(n-1) - 2, with n>1, a(1)=7.
G.f.: x*(7 + x^2)/((1+x)*(1-x)^2). - Vincenzo Librandi, Sep 18 2013
a(n) = a(n-1) +a(n-2) -a(n-3). - Vincenzo Librandi, Sep 18 2013
a(n) = 7 + 8*floor((n-1)/2). - Bruno Berselli, Sep 18 2013
E.g.f.: (-2 + exp(x) + (4*x + 1)*exp(2*x))*exp(-x). - G. C. Greubel, Jul 19 2016

Extensions

Definition rewritten by Vincenzo Librandi, Sep 18 2013