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-1 of 1 results.

A385589 a(n) = 2^(n-2)*(3*binomial(n,3) + 6*binomial(n,2) + 6*n + 4).

Original entry on oeis.org

1, 5, 22, 86, 304, 992, 3040, 8864, 24832, 67328, 177664, 458240, 1159168, 2883584, 7069696, 17113088, 40960000, 97058816, 227934208, 530972672, 1227882496, 2820669440, 6440353792, 14623440896, 33034338304, 74272735232, 166262210560, 370675810304, 823291543552, 1822139875328
Offset: 0

Views

Author

Enrique Navarrete, Jul 03 2025

Keywords

Comments

a(n) is the number of words of length n defined on 5 letters that contain zero or one a's, zero or one b's, zero or one c's, and any number of d's and e's.

Examples

			a(1) = 5 since the words are a, b, c, d, e.
a(2) = 22 since the words are ab, ba, ac, ca, ad, da, ae, ea, bc, cb, bd, db, be, eb, cd, dc, ce, ec, de, ed, dd, ee.
		

Crossrefs

Cf. A385407.

Programs

  • Mathematica
    LinearRecurrence[{8, -24, 32, -16}, {1, 5, 22, 86}, 30] (* Amiram Eldar, Jul 03 2025 *)

Formula

E.g.f.: exp(2*x)*(1+x)^3.
G.f.: (1 - 3*x + 6*x^2 - 2*x^3)/(1 - 2*x)^4. - Stefano Spezia, Jul 03 2025
Showing 1-1 of 1 results.