The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A059522 a(1) = 1, then a(n) = n*(n^(n-1)-1)*(n-2)!/(n-1). 2
 1, 2, 12, 168, 4680, 223920, 16470720, 1725655680, 244074902400, 44799999955200, 10353389902732800, 2941340482417075200, 1007483754568427136000, 409436080665631065446400, 194769597399609368328192000, 107210375103315036907081728000, 67610055415398119744255815680000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Harry J. Smith, Table of n, a(n) for n = 1..200 FORMULA a(n) = (n-1)!*A058128(n), n>1. MATHEMATICA Join[{1}, Table[n(n^(n-1)-1) (n-2)!/(n-1), {n, 2, 20}]] (* Harvey P. Dale, Feb 17 2020 *) PROG (PARI) { for (n = 1, 200, if (n==1, a=1, a=n*(n^(n - 1) - 1)*(n - 2)!/(n - 1)); write("b059522.txt", n, " ", a); ) } \\ Harry J. Smith, Jun 27 2009 (Magma) [1] cat [n*(n^(n-1)-1)*Factorial(n-2)/(n-1): n in [2..17]]; // Vincenzo Librandi, Feb 18 2020 CROSSREFS Cf. A058128. Sequence in context: A052729 A098431 A231085 * A271857 A113149 A156143 Adjacent sequences: A059519 A059520 A059521 * A059523 A059524 A059525 KEYWORD nonn,easy AUTHOR N. J. A. Sloane, Feb 16 2001 STATUS approved

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

Last modified March 23 16:55 EDT 2023. Contains 361449 sequences. (Running on oeis4.)