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.

A014929 a(1)=1, a(n) = n*14^(n-1) + a(n-1).

Original entry on oeis.org

1, 29, 617, 11593, 203673, 3430617, 56137369, 899445401, 14181546905, 220792014745, 3402593219481, 51997375255449, 789018236134297, 11901025061692313, 178581127445062553, 2667670656370058137, 39692877399129367449, 588537118527090893721, 8699235348529189004185
Offset: 1

Views

Author

Keywords

Programs

Formula

From R. J. Mathar, Mar 05 2008: (Start)
a(n) = (1 + (13*n - 1)*14^n)/169.
O.g.f.: x/((14*x-1)^2*(1-x)). (End)
From Elmo R. Oliveira, May 16 2025: (Start)
E.g.f.: exp(x)*(1 + exp(13*x)*(182*x - 1))/169.
a(n) = 28*a(n-1) - 196*a(n-2) + 1 for n > 2.
a(n) = 29*a(n-1) - 224*a(n-2) + 196*a(n-3) for n > 3. (End)

Extensions

More terms from Vincenzo Librandi, Mar 04 2014