|
Search: id:A062206
|
|
| |
|
| 1, 1, 16, 729, 65536, 9765625, 2176782336, 678223072849, 281474976710656, 150094635296999121, 100000000000000000000, 81402749386839761113321, 79496847203390844133441536, 91733330193268616658399616009
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
a(n) = A155955(n,n) = A000290(A000312(n)). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 31 2009]
a(n) is also the number of sequences of length 2n on n symbols. [From W Bomfim (webonfim(AT)bol.com.br), Oct 06 2009]
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=0,...,100
|
|
FORMULA
|
a(n) = n^(2n).
(-1)^n*determinant of the 2n X 2n matrix M_(i, j) = i+j if (i + j) is a multiple of n, M_(i, j) = 1 otherwise. - Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 06 2003
|
|
MAPLE
|
a0:=0, seq(mul(n^2, k=1..n), n=1..13); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Feb 15 2008
|
|
PROGRAM
|
(PARI) { for (n=0, 100, write("b062206.txt", n, " ", n^(2*n)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 02 2009]
|
|
CROSSREFS
|
Cf. A062207.
A155957. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 31 2009]
Sequence in context: A053907 A036513 A123824 this_sequence A086701 A159375 A129008
Adjacent sequences: A062203 A062204 A062205 this_sequence A062207 A062208 A062209
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Jason Earls (zevi_35711(AT)yahoo.com), Jun 13 2001
|
|
EXTENSIONS
|
More terms from Larry Reeves (larryr(AT)acm.org), Jun 15 2001
Initial term corrected Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 30 2009
|
|
|
Search completed in 0.002 seconds
|
