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.

A319842 a(n) = 8 * A104720(n) + ceiling(n/2).

Original entry on oeis.org

8, 89, 897, 8978, 89786, 897867, 8978675, 89786756, 897867564, 8978675645, 89786756453, 897867564534, 8978675645342, 89786756453423, 897867564534231, 8978675645342312, 89786756453423120, 897867564534231201, 8978675645342312009, 89786756453423120090, 897867564534231200898, 8978675645342312008979
Offset: 0

Views

Author

Seiichi Manyama, Sep 29 2018

Keywords

Crossrefs

Programs

  • Mathematica
    a[n_]:=(198*n - 243*(-1)^n + 2^(n+8)*5^(n+3) - 3245)/3564; Array[a, 50, 0] (* Stefano Spezia, Sep 29 2018 *)
    LinearRecurrence[{11,-9,-11,10},{8,89,897,8978},40] (* Harvey P. Dale, Apr 11 2019 *)
  • PARI
    {a(n) = (198*n-243*(-1)^n+2^(n+8)*5^(n+3)-3245)/3564}
    
  • PARI
    Vec((8 + x - 10*x^2) / ((1 - x)^2*(1 + x)*(1 - 10*x)) + O(x^25)) \\ Colin Barker, Sep 29 2018

Formula

a(n) = (198*n - 243*(-1)^n + 2^(n+8)*5^(n+3) - 3245)/3564.
From Colin Barker, Sep 29 2018: (Start)
G.f.: (8 + x - 10*x^2) / ((1 - x)^2*(1 + x)*(1 - 10*x)).
a(n) = 11*a(n-1) - 9*a(n-2) - 11*a(n-3) + 10*a(n-4) for n>3.
(End)