|
Search: id:A104712
|
|
|
| A104712 |
|
Pascal's triangle, with the first two columns removed. |
|
+0 4
|
|
| 1, 3, 1, 6, 4, 1, 10, 10, 5, 1, 15, 20, 15, 6, 1, 21, 35, 35, 21, 7, 1, 28, 56, 70, 56, 28, 8, 1, 36, 84, 126, 126, 84, 36, 9, 1, 45, 120, 210, 252, 210, 120, 45, 10, 1, 55, 165, 330, 462, 462, 330, 165, 55, 11, 1, 66, 220, 495, 792, 924, 792, 495, 220, 66, 12, 1, 78, 286, 715
(list; table; graph; listen)
|
|
|
OFFSET
|
2,2
|
|
|
COMMENT
|
A000295 (Eulerian numbers) gives the row sums.
Write A004736 and Pascal's triangle as infinite lower triangular matrices A and B; then A*B is this triangle.
|
|
FORMULA
|
a(n, k) = binomial(n, k), for 2 <= k <= n.
|
|
EXAMPLE
|
Triangle begins
1
3 1
6 4 1
10 10 5 1
15 20 15 6 1
...
|
|
CROSSREFS
|
Cf. A000295, A007318, A008292, A104713.
Sequence in context: A120029 A133110 A086270 this_sequence A122177 A108286 A131415
Adjacent sequences: A104709 A104710 A104711 this_sequence A104713 A104714 A104715
|
|
KEYWORD
|
nonn,tabl,easy,less
|
|
AUTHOR
|
Gary W. Adamson (qntmpkt(AT)yahoo.com), Mar 19 2005
|
|
EXTENSIONS
|
Edited and extended by David Wasserman (dwasserm(AT)earthlink.net), Jul 03 2007
|
|
|
Search completed in 0.002 seconds
|