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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A061250 a(n) = (n-2)*(n-1)^n. 4

%I #11 Feb 07 2023 21:25:27

%S 0,0,8,162,3072,62500,1399680,34588806,939524096,27894275208,

%T 900000000000,31384283767210,1176925259169792,47248516628391468,

%U 2022385242251558912,91957716979980468750,4427218577690292387840,225009351233083599856144,12040000871040740498079744

%N a(n) = (n-2)*(n-1)^n.

%H Milan Janjic, <a href="http://www.pmfbl.org/janjic/">Enumerative Formulas for Some Functions on Finite Sets</a>

%t Table[(n-2)*(n-1)^n,{n,20}] (* _Vladimir Joseph Stephan Orlovsky_, Jan 29 2012 *)

%Y Cf. A143857. [From _Reinhard Zumkeller_, Jul 23 2010]

%K nonn,easy

%O 1,3

%A Gero Burghardt (gerogoestohollywood(AT)yahoo.de), Jun 01 2001

%E More terms from _Klaus Brockhaus_ and Larry Reeves (larryr(AT)acm.org), Jun 03 2001

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 16 23:59 EDT 2024. Contains 375984 sequences. (Running on oeis4.)