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!)
A006236 n^(n-2)*(n+2)^(n-1).
(Formerly M3698)
1
1, 4, 75, 3456, 300125, 42467328, 8931928887, 2621440000000, 1025271882697689, 515978035200000000, 325063112540091870659, 250738401558910243700736, 232526248038920243408203125, 255326682647558617373989666816, 327696095670976278474202880859375, 486146690661928563361690196851556352 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
REFERENCES
G. Kreweras, Complexite et circuits Euleriens dans les sommes tensorielles de graphes, J. Combin. Theory, B 24 (1978), 202-212.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
MATHEMATICA
Table[n^(n - 2)*(n + 2)^(n - 1), {n, 20}] (* T. D. Noe, May 29 2012 *)
CROSSREFS
Sequence in context: A006412 A206456 A137220 * A120248 A191505 A100323
KEYWORD
nonn
AUTHOR
N. J. A. Sloane. Clarified definition, added more terms, May 27 2012.
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 04:42 EDT 2024. Contains 371964 sequences. (Running on oeis4.)