|
Search: id:A124846
|
|
|
| A124846 |
|
Triangle read by rows: T(n,k)=[2-(-1)^k]binom(n,k) (0<=k<=n). |
|
+0
1
|
|
| 1, 1, 3, 1, 6, 1, 1, 9, 3, 3, 1, 12, 6, 12, 1, 1, 15, 10, 30, 5, 3, 1, 18, 15, 60, 15, 18, 1, 1, 21, 21, 105, 35, 63, 7, 3, 1, 24, 28, 168, 70, 168, 28, 24, 1, 1, 27, 36, 252, 126, 378, 84, 108, 9, 3, 1, 30, 45, 360, 210, 756, 210, 360, 45, 30, 1, 1, 33, 55, 495, 330, 1386, 462, 990
(list; table; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
EXAMPLE
|
First few rows of the triangle are:
1;
1, 3;
1, 6, 1;
1, 9, 3, 3;
1, 12, 6, 12, 1;
1, 15, 10, 30, 5, 3;
...
A046055(4) = 16 = sum of row 4 terms (1 + 9 + 3 + 3).
|
|
MAPLE
|
T:=(n, k)->(2-(-1)^k)*binomial(n, k): for n from 0 to 12 do seq(T(n, k), k=0..n) od; # yields sequence in triangular form
|
|
CROSSREFS
|
Cf. A010684, A046055, A124845.
Adjacent sequences: A124843 A124844 A124845 this_sequence A124847 A124848 A124849
Sequence in context: A083238 A117782 A116609 this_sequence A099512 A127096 A128489
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Gary W. Adamson (qntmpkt(AT)yahoo.com), Nov 10 2006
|
|
EXTENSIONS
|
Edited by njas, Nov 24 2006
|
|
|
Search completed in 0.002 seconds
|
