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.

A017485 a(n) = 11*n + 8.

Original entry on oeis.org

8, 19, 30, 41, 52, 63, 74, 85, 96, 107, 118, 129, 140, 151, 162, 173, 184, 195, 206, 217, 228, 239, 250, 261, 272, 283, 294, 305, 316, 327, 338, 349, 360, 371, 382, 393, 404, 415, 426, 437, 448, 459, 470, 481, 492, 503, 514, 525, 536, 547, 558, 569, 580, 591, 602, 613
Offset: 0

Views

Author

N. J. A. Sloane, Dec 11 1996

Keywords

Comments

a(n) = A125199(n+1,3) for n>1. - Reinhard Zumkeller, Nov 24 2006

Crossrefs

Powers of the form (11*n+8)^m: this sequence (m=1), A017486 (m=2), A017487 (m=3), A017488 (m=4), A017489 (m=5), A017490 (m=6), A017491 (m=7), A017492 (m=8), A017493 (m=9), A017494 (m=10), A017495 (m=11), A017496 (m=12).

Programs

Formula

a(n) = 22*n + 5 - a(n-1), with n>0, a(0)=8. - Vincenzo Librandi, Dec 24 2010
From Colin Barker, Oct 05 2014: (Start)
a(n) = 2*a(n-1) - a(n-2).
G.f.: (8 + 3*x)/(1-x)^2. (End)
E.g.f.: (8 + 11*x)*exp(x). - G. C. Greubel, Sep 21 2019