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.

A014827 a(1)=1, a(n) = 5*a(n-1) + n.

Original entry on oeis.org

1, 7, 38, 194, 975, 4881, 24412, 122068, 610349, 3051755, 15258786, 76293942, 381469723, 1907348629, 9536743160, 47683715816, 238418579097, 1192092895503, 5960464477534, 29802322387690, 149011611938471, 745058059692377, 3725290298461908, 18626451492309564, 93132257461547845
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

Formula

a(n) = (5^(n+1) - 4*n - 5)/16.
G.f.: x/((1-5*x)*(1-x)^2).
From Paul Barry, Jul 30 2004: (Start)
a(n) = Sum_{k=0..n} (n-k)*5^k = Sum_{k=0..n} k*5^(n-k).
a(n) = Sum_{k=0..n} binomial(n+2,k+2)*4^k [Offset 0]. (End)
From Elmo R. Oliveira, Mar 29 2025: (Start)
E.g.f.: exp(x)*(5*exp(4*x) - 4*x - 5)/16.
a(n) = 7*a(n-1) - 11*a(n-2) + 5*a(n-3) for n > 3. (End)