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.

A048476 a(n) = T(4,n), array T given by A048472.

Original entry on oeis.org

1, 6, 21, 61, 161, 401, 961, 2241, 5121, 11521, 25601, 56321, 122881, 266241, 573441, 1228801, 2621441, 5570561, 11796481, 24903681, 52428801, 110100481, 230686721, 482344961, 1006632961, 2097152001, 4362076161, 9059696641, 18790481921, 38923141121
Offset: 0

Views

Author

Keywords

Comments

n-th difference of a(n), a(n-1), ..., a(0) is (5, 10, 15, ...).

Programs

  • Magma
    [5*n * 2^(n-1) + 1: n in [0..30]]; // Vincenzo Librandi, Sep 23 2011
    
  • PARI
    Vec((1+x-x^2)/((1-x)*(1-2*x)^2) + O(x^40)) \\ Colin Barker, Feb 18 2016

Formula

a(n) = 5*n * 2^(n-1) + 1.
a(n) = 5*a(n-1)-8*a(n-2)+4*a(n-3) for n>2. G.f.: (1+x-x^2) / ((1-x)*(1-2*x)^2). - Colin Barker, Feb 18 2016