|
| |
|
|
A051128
|
|
Table T(n,k) = n^k read by antidiagonals (n >= 1, k >= 1).
|
|
7
| |
|
|
1, 2, 1, 3, 4, 1, 4, 9, 8, 1, 5, 16, 27, 16, 1, 6, 25, 64, 81, 32, 1, 7, 36, 125, 256, 243, 64, 1, 8, 49, 216, 625, 1024, 729, 128, 1, 9, 64, 343, 1296, 3125, 4096, 2187, 256, 1, 10, 81, 512, 2401, 7776, 15625, 16384, 6561, 512, 1, 11, 100, 729, 4096, 16807, 46656
(list; table; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| Sum of anti-diagonals is A003101(n) for n>0. - Alford Arnold (Alford1940(AT)aocom), Jan 14 2007
|
|
|
LINKS
| T. D. Noe, Rows n=1..50 of triangle, flattened
G. Labelle, C. Lamathe and P. Leroux, Labeled and unlabeled enumeration of k-gonal 2-trees
|
|
|
EXAMPLE
| Table begins
1 1 1 1 1 ...
2 4 8 16 32 ...
3 9 27 81 243 ...
4 16 64 256 1024 ...
|
|
|
CROSSREFS
| Cf. A051129, A003992, A004248.
Cf. A003101.
Sequence in context: A171275 A107616 A055208 * A137614 A204213 A143326
Adjacent sequences: A051125 A051126 A051127 * A051129 A051130 A051131
|
|
|
KEYWORD
| nonn,tabl,easy,nice
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
EXTENSIONS
| More terms from James A. Sellers (sellersj(AT)math.psu.edu), Dec 11 1999
|
| |
|
|