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!)
A181044 The number of ways to compute the determinant of an n X n matrix using cofactor expansion. 2
1, 4, 384, 173946175488, 1592481597212922365761871004823571903636713118111555911680 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
REFERENCES
Robert A. Beeler, How to Count: An Introduction to Combinatorics and Its Applications, Springer International Publishing, 2015. See Theorem 6.1.9 at p. 153.
LINKS
Robert A. Beeler, A Note on the number of ways to compute a determinant using cofactor expansion, Bull. Inst. Combin. Appl., 63 (2011), 36-38. [ResearchGate link]
FORMULA
a(n) = 2*n*(a(n-1))^n.
a(n) = 2*2^n*2^(n*(n-1))*2^(n*(n-1)*(n-2))*...*2^(n*(n-1)*...*4*3)*n*(n-1)^n*(n-2)^(n*(n-1))*(n-3)^(n*(n-1)*(n-2))*...*2^(n*(n-1)*...*4*3).
From Robert A. Beeler, Oct 11 2010: (Start)
4^(n!*(e-2)) < a(n) < (2*e)^(n!*(e-2)).
a(n) ~ A363767^n!. (End)
MATHEMATICA
a[1]=1; a[n_]:=2n a[n-1]^n; Array[a, 5] (* Stefano Spezia, Jun 20 2023 *)
PROG
(PARI) a(n) = if (n==1, 1, 2*n*a(n-1)^n); \\ Michel Marcus, Jun 21 2023
CROSSREFS
Cf. A363767.
Sequence in context: A003753 A193130 A006237 * A339449 A116031 A115049
KEYWORD
nonn
AUTHOR
Robert A. Beeler, Sep 30 2010
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 24 04:14 EDT 2024. Contains 371918 sequences. (Running on oeis4.)