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.

A094795 a(n) = (1/n!)*A023043(n).

Original entry on oeis.org

265, 2119, 9403, 30637, 81901, 190435, 398959, 770713, 1395217, 2394751, 3931555, 6215749, 9513973, 14158747, 20558551, 29208625, 40702489, 55744183, 75161227, 99918301, 131131645, 170084179, 218241343, 277267657, 349044001, 435685615
Offset: 0

Views

Author

Benoit Cloitre, Jun 11 2004

Keywords

Crossrefs

Programs

  • Mathematica
    LinearRecurrence[{7,-21,35,-35,21,-7,1},{265,2119,9403,30637,81901,190435,398959},30] (* Harvey P. Dale, Aug 29 2023 *)

Formula

a(n) = n^6 + 15*n^5 + 100*n^4 + 355*n^3 + 694*n^2 + 689*n + 265.
G.f.: -(265 + 264*x + 135*x^2 + 40*x^3 + 15*x^4 + x^6)/(x-1)^7. - R. J. Mathar, Nov 15 2019
P-recursive: n*a(n) = (n+7)*a(n-1) - a(n-2) with a(0) = 265 and a(1) = 2119. Cf. A094791. - Peter Bala, Jul 25 2021