|
|
A002489
|
|
a(n) = n^(n^2), or (n^n)^n.
(Formerly M5030 N2170)
|
|
54
|
|
|
1, 1, 16, 19683, 4294967296, 298023223876953125, 10314424798490535546171949056, 256923577521058878088611477224235621321607, 6277101735386680763835789423207666416102355444464034512896, 196627050475552913618075908526912116283103450944214766927315415537966391196809
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
The number of closed binary operations on a set of order n. Labeled groupoids.
The values of "googol" in base N: "10^100" in base 2 is 2^4=16; "10^100" in base 3 is 3^9=19683, etc. This is N^^3 by the "lower-valued" (left-associative) definition of the hyper4 or tetration operator (see Munafo webpage). - Robert Munafo, Jan 25 2010
n^(n^k) = (((n^n)^n)^...)^n, with k+1 n's, k >= 0. - Daniel Forgues, May 18 2013
|
|
REFERENCES
|
John S. Rose, A Course on Group Theory, Camb. Univ. Press, 1978, see p. 6.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
a(3) = 19683 because (3^3)^3 = 3^(3^2) = 19683.
|
|
MATHEMATICA
|
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|