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.

A055869 a(n) = (n+1)^n - n^n.

Original entry on oeis.org

1, 5, 37, 369, 4651, 70993, 1273609, 26269505, 612579511, 15937424601, 457696700077, 14381984674225, 490839666661891, 18080919199832609, 715027614225987601, 30214447801957316865, 1358671297852359767791, 64780942222614703957417, 3264460344339686410876021
Offset: 1

Views

Author

Wolfdieter Lang, Jun 20 2000

Keywords

Comments

Number of functions f:[n]->[n+1] such that some x in [n] maps to n+1.
Number of switching generators for a power polyadic n-context ({1..k}, ..., {1..k}, <>) with n=k [Theorems 5 and 6, page 81, in Ignatov]. - Dmitry I. Ignatov, Nov 23 2022

Crossrefs

Row sums of triangle A055864.

Programs

Formula

E.g.f.: W(-x)*(x-1)/((1+W(-x))*x), W(x) principal branch of Lambert's function.
a(n) = Sum_{m=1..n} A055864(n, m).
a(n) = Sum_{i=0..n-1} n^i*C(n, i). - Olivier Gérard, Jun 26 2001
With interpolated zeros, ceiling(n/2)^floor(n/2) - floor(n/2)^floor(n/2). - Paul Barry, Jul 13 2005
a(n) = Sum_{k=1..n} (-1)^(n-k)*k!*Stirling2(n,k)*binomial(n+k-1,n). - Vladimir Kruchinin, Sep 20 2015

Extensions

More terms from Vincenzo Librandi, Jan 11 2015