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.

A368553 a(n) = Sum_{k=0..n} k^k * 2^(n-k).

Original entry on oeis.org

1, 3, 10, 47, 350, 3825, 54306, 932155, 18641526, 424703541, 10849407082, 307010484775, 9530121417806, 321935349427865, 11755877524413746, 461405645429686867, 19369555364568925350, 865979372615474614877, 41078366820527486805178
Offset: 0

Views

Author

Seiichi Manyama, Dec 29 2023

Keywords

Crossrefs

Programs

  • PARI
    a(n) = sum(k=0, n, k^k*2^(n-k));

Formula

a(0) = 1; a(n) = 2*a(n-1) + n^n.
a(n) ~ n^n. - Vaclav Kotesovec, Jan 13 2024
Showing 1-1 of 1 results.