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.

A017511 a(n) = (11*n + 10)^3.

Original entry on oeis.org

1000, 9261, 32768, 79507, 157464, 274625, 438976, 658503, 941192, 1295029, 1728000, 2248091, 2863288, 3581577, 4410944, 5359375, 6434856, 7645373, 8998912, 10503459, 12167000, 13997521, 16003008, 18191447, 20570824, 23149125, 25934336, 28934443, 32157432
Offset: 0

Views

Author

Keywords

Crossrefs

Powers of the form (11*n+10)^m: A017509 (m=1), A017510 (m=2), this sequence (m=3), A017512 (m=4), A017513 (m=5), A017514 (m=6), A017515 (m=7), A017516 (m=8), A017517 (m=9), A017518 (m=10), A017519 (m=11), A017520 (m=12).

Programs

Formula

G.f.: (1000 + 5261*x + 1724*x^2 + x^3)/(1-x)^4. - Vincenzo Librandi, May 26 2016
a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4), for n>3. - Vincenzo Librandi, May 26 2016
a(n) = A000578(A017509(n)). - Michel Marcus, May 26 2016
E.g.f.: (1000 + 8261*x + 7623*x^2 + 1331*x^3)*exp(x). - G. C. Greubel, Oct 29 2019