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.

A066068 a(n) = n^n + n.

Original entry on oeis.org

1, 2, 6, 30, 260, 3130, 46662, 823550, 16777224, 387420498, 10000000010, 285311670622, 8916100448268, 302875106592266, 11112006825558030, 437893890380859390, 18446744073709551632, 827240261886336764194
Offset: 0

Views

Author

George E. Antoniou, Dec 02 2001

Keywords

Crossrefs

Programs

Formula

E.g.f.: (1-x*e^x*T(x)+x*e^x)/(1-T(x)), where T(x) is Euler's tree function (see A000169). - Len Smiley, Dec 04 2001
Resultant of nx^n+1 and nx-1. - Ralf Stephan, Nov 20 2004
a(n) = n*A124923(n), n>0. - R. J. Mathar, Oct 31 2015
Sum_{n>=1} 1/a(n) = A286193. - Amiram Eldar, Nov 19 2020
Showing 1-1 of 1 results.