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.

Showing 1-2 of 2 results.

A380491 a(n) = n! * Sum_{k=0..n} binomial(2*n-3,k)/(n-k)!.

Original entry on oeis.org

1, 0, 3, 34, 501, 9276, 207775, 5470158, 165625929, 5671386136, 216730118331, 9144481575450, 422249317829053, 21180324426577044, 1146880568461500951, 66677192513929212166, 4142571510546929867025, 273910161452560881843888, 19204878684852222745880179
Offset: 0

Views

Author

Seiichi Manyama, Jan 25 2025

Keywords

Crossrefs

Programs

  • PARI
    a(n) = n!*pollaguerre(n, n-3, -1);

Formula

a(n) = n! * LaguerreL(n, n-3, -1).
a(n) = n! * [x^n] exp(x/(1 - x))/(1 - x)^(n-2).

A380492 a(n) = n! * Sum_{k=0..n} binomial(2*n-2,k)/(n-k)!.

Original entry on oeis.org

1, 1, 7, 73, 1045, 19081, 424051, 11109337, 335262313, 11453449105, 436944953791, 18412283563081, 849345673881277, 42570185481576793, 2303643608370636715, 133859418832759525081, 8312945340897388101841, 549460711493172343519777, 38513032385247860120975863
Offset: 0

Views

Author

Seiichi Manyama, Jan 25 2025

Keywords

Crossrefs

Programs

  • PARI
    a(n) = n!*pollaguerre(n, n-2, -1);

Formula

a(n) = n! * LaguerreL(n, n-2, -1).
a(n) = n! * [x^n] exp(x/(1 - x))/(1 - x)^(n-1).
Showing 1-2 of 2 results.