Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A051128
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A051128 Table T(n,k) = n^k read by antidiagonals (n >= 1, k >= 1). +0
5
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; listen)
OFFSET

1,2

COMMENT

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: A125103 A107616 A055208 this_sequence A137614 A143326 A053122

Adjacent sequences: A051125 A051126 A051127 this_sequence 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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research