|
Search: id:A059674
|
|
|
| A059674 |
|
Pascal's square a(m,n)=binomial(max(m,n),min(m,n)) (m >= 0, n >= 9) read by antidiagonals. |
|
+0
1
|
|
| 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 3, 1, 3, 1, 1, 4, 3, 3, 4, 1, 1, 5, 6, 1, 6, 5, 1, 1, 6, 10, 4, 4, 10, 6, 1, 1, 7, 15, 10, 1, 10, 15, 7, 1, 1, 8, 21, 20, 5, 5, 20, 21, 8, 1, 1, 9, 28, 35, 15, 1, 15, 35, 28, 9, 1, 1, 10, 36, 56, 35, 6, 6, 35, 56, 36, 10, 1, 1, 11, 45, 84, 70, 21, 1, 21, 70, 84
(list; table; graph; listen)
|
|
|
OFFSET
|
0,8
|
|
|
EXAMPLE
|
a(2,4)=binomial(max(2,4),min(2,4))=binomial(4,2)=6.
Square begins
1 1 1 1 1 1 ...
1 1 2 3 4 5 ...
1 2 1 3 6 10...
1 3 3 1 4 10 ...
|
|
CROSSREFS
|
Cf. A007318.
Sequence in context: A079692 A110269 A120964 this_sequence A117545 A047000 A139767
Adjacent sequences: A059671 A059672 A059673 this_sequence A059675 A059676 A059677
|
|
KEYWORD
|
easy,nice,nonn,tabl
|
|
AUTHOR
|
Fabian Rothelius (fabian.rothelius(AT)telia.com), Feb 05 2001
|
|
EXTENSIONS
|
More terms from Larry Reeves (larryr(AT)acm.org), Feb 06 2001
|
|
|
Search completed in 0.002 seconds
|
