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.

A377682 Expansion of e.g.f. (1 - x * log(1 - x))^2.

Original entry on oeis.org

1, 0, 4, 6, 40, 180, 948, 5880, 42208, 344736, 3158640, 32091840, 358107264, 4353972480, 57290002560, 811116633600, 12295029657600, 198666240675840, 3408788192947200, 61898371424870400, 1185883197069312000, 23905764186329088000, 505813884019270041600
Offset: 0

Views

Author

Seiichi Manyama, Nov 04 2024

Keywords

Crossrefs

Programs

  • PARI
    a(n) = n!*sum(k=0, n\2, k!*binomial(2, k)*abs(stirling(n-k, k, 1))/(n-k)!);

Formula

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

A377683 Expansion of e.g.f. (1 - x * log(1 - x))^3.

Original entry on oeis.org

1, 0, 6, 9, 96, 450, 3132, 22680, 179904, 1578528, 15282000, 162304560, 1879227072, 23579281440, 318874800384, 4625170411680, 71640771563520, 1180394962790400, 20616532017767424, 380509312545031680, 7400308896979660800, 151271976281858611200, 3242509236999683481600
Offset: 0

Views

Author

Seiichi Manyama, Nov 04 2024

Keywords

Crossrefs

Programs

  • PARI
    a(n) = n!*sum(k=0, n\2, k!*binomial(3, k)*abs(stirling(n-k, k, 1))/(n-k)!);

Formula

a(n) = n! * Sum_{k=0..floor(n/2)} k! * binomial(3,k) * |Stirling1(n-k,k)|/(n-k)!.
Showing 1-2 of 2 results.