Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036740
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036740 (n!)^n. +0
21
1, 1, 4, 216, 331776, 24883200000, 139314069504000000, 82606411253903523840000000, 6984964247141514123629140377600000000, 109110688415571316480344899355894085582848000000000 (list; graph; listen)
OFFSET

0,3

COMMENT

(-1)^n*a(n) is the determinant of the n X n matrix m_{i,j}=T(n+i,j) 1<=i,j<=n. where T(n,k) are the signed Stirling numbers of first kind A008275. Derived from methods given in Krattenthaler link. - Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 17 2005

Contribution from W. Edwin Clark (eclark(AT)math.usf.edu), Apr 09 2009: (Start)

a(n) is also the number of binary operations on an n element set which are

right (or left) cancellative. These are also called right (left) cancellative

magma or groupoids. The multiplication table of a right (left) cancellative

magma is an n by n matrix with entries from an n element set such that the

elements in each column (or row) are distinct. (End)

LINKS

Christian Krattenthaler, Advanced Determinant Calculus.

FORMULA

a(n) = a(n-1)*n^n*(n-1)! = a(n-1)*A000169(n)*A000142(n) = A036740(n-1)*A000312(n)*A000142(n-1). - Henry Bottomley (se16(AT)btinternet.com), Dec 06 2001

a(n)=prod(k=1, n, (k-1)!*k^k); a(n)=A000178(n-1)*A002109(n) - Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 17 2005

MAPLE

seq(mul(mul(j, j=1..n), k=1..n), n=0..9); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 02 2007

seq(mul(j^n, j=1..n), n=0..9); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 02 2007

restart:with (combinat):a:=n->mul(-stirling1(n, 1), j=2..n): seq(a(n), n=1..10); # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Dec 31 2008]

MATHEMATICA

lst={}; Do[a=n!^n; AppendTo[lst, a], {n, 0, 13}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Oct 01 2008]

PROGRAM

(PARI) a(n)=n!^n

CROSSREFS

A002109(n)*A000178(n-1) = (n!)^n = A036740(n) for n >= 1.

Sequence in context: A042325 A091287 A055627 this_sequence A038786 A072694 A068210

Adjacent sequences: A036737 A036738 A036739 this_sequence A036741 A036742 A036743

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

page 1

Search completed in 0.003 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research