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.

A017437 a(n) = 11*n + 4.

Original entry on oeis.org

4, 15, 26, 37, 48, 59, 70, 81, 92, 103, 114, 125, 136, 147, 158, 169, 180, 191, 202, 213, 224, 235, 246, 257, 268, 279, 290, 301, 312, 323, 334, 345, 356, 367, 378, 389, 400, 411, 422, 433, 444, 455, 466, 477, 488, 499, 510, 521, 532, 543, 554, 565, 576, 587
Offset: 0

Views

Author

Keywords

Comments

These numbers do not occur in A000045 (Fibonacci numbers). - Arkadiusz Wesolowski, Jan 08 2012

Crossrefs

Powers of the form (11*n+4)^m: this sequence (m=1), A017438 (m=2), A017439 (m=3), A017440 (m=4), A017441 (m=5), A017442 (m=6), A017443 (m=7), A017444 (m=8), A017445 (m=9), A017446 (m=10), A017447 (m=11), A017448 (m=12).

Programs

Formula

a(0)=4, a(1)=15, a(n) = 2*a(n-1) - a(n-2). - Harvey P. Dale, May 19 2012
From G. C. Greubel, Sep 18 2019: (Start)
G.f.: (4 + 7*x)/(1-x)^2.
E.g.f.: (4 + 11*x)*exp(x). (End)