|
Search: id:A089072
|
|
|
| A089072 |
|
Triangle read by rows: T(n,k) = k^n, n>=1, 1<=k<=n. |
|
+0
4
|
|
| 1, 1, 4, 1, 8, 27, 1, 16, 81, 256, 1, 32, 243, 1024, 3125, 1, 64, 729, 4096, 15625, 46656, 1, 128, 2187, 16384, 78125, 279936, 823543, 1, 256, 6561, 65536, 390625, 1679616, 5764801, 16777216, 1, 512, 19683, 262144, 1953125, 10077696, 40353607
(list; table; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
T(n,k) = number of mappings from an n-element set into a k-element set. - Clark Kimberling (ck6(AT)evansville.edu), Nov 26 2004
|
|
EXAMPLE
|
Triangle begins:
1
1 4
1 8 27
1 16 81 256
1 32 243 1024 3125
1 64 729 4096 15625 46656
|
|
CROSSREFS
|
Related to triangle of Eulerian numbers A008292.
Adjacent sequences: A089069 A089070 A089071 this_sequence A089073 A089074 A089075
Sequence in context: A013611 A077910 A100235 this_sequence A036177 A123726 A138675
|
|
KEYWORD
|
easy,nonn,tabl
|
|
AUTHOR
|
Alford Arnold (Alford1940(AT)aol.com), Dec 04 2003
|
|
EXTENSIONS
|
More terms and better definition from Herman Jamke (hermanjamke(AT)fastmail.fm), Jul 10 2004
|
|
|
Search completed in 0.002 seconds
|
