login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A089205 a(n) = n^n * (n-1). 0
0, 4, 54, 768, 12500, 233280, 4941258, 117440512, 3099363912, 90000000000, 2853116706110, 98077104930816, 3634501279107036, 144456088732254208, 6130514465332031250, 276701161105643274240, 13235844190181388226832 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..17.

Milan Janjic, Enumerative Formulas for Some Functions on Finite Sets

FORMULA

E.g.f.: -(1 + 3*LambertW(-x) + LambertW(-x)^2)/(1+LambertW(-x))^3. - Vladeta Jovovic, Dec 12 2003

MATHEMATICA

f[n_]:=(n^(n+1)-n^n); lst={}; Do[AppendTo[lst, f[n]], {n, 5!}]; lst (* Vladimir Joseph Stephan Orlovsky, Feb 07 2010 *)

PROG

(PARI) g(n) = for(x=1, n, print1(x^x*(x-1)", "))

CROSSREFS

Sequence in context: A199022 A221395 A241126 * A055774 A071248 A221611

Adjacent sequences:  A089202 A089203 A089204 * A089206 A089207 A089208

KEYWORD

easy,nonn

AUTHOR

Cino Hilliard, Dec 09 2003

EXTENSIONS

More terms from Vladeta Jovovic, Dec 12 2003

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 8 22:51 EST 2016. Contains 278957 sequences.