|
Search: id:A026009
|
|
|
| A026009 |
|
Triangular array T read by rows: T(n,0) = 1 for n >= 0; T(1,1) = 1; and for n >= 2, T(n,k) = T(n-1,k-1) + T(n-1,k) for k = 1,2,...,[(n+1)/2]; T(n,n/2 + 1) = T(n-1,n/2) if n is even. |
|
+0
19
|
|
| 1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 4, 6, 3, 1, 5, 10, 9, 1, 6, 15, 19, 9, 1, 7, 21, 34, 28, 1, 8, 28, 55, 62, 28, 1, 9, 36, 83, 117, 90, 1, 10, 45, 119, 200, 207, 90, 1, 11, 55, 164, 319, 407, 297, 1, 12, 66, 219, 483, 726, 704, 297, 1, 13, 78, 285, 702, 1209, 1430, 1001, 1, 14, 91, 363, 987, 1911
(list; table; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
FORMULA
|
T(n, k) = binomial(n, k) - binomial(n, k-3). - Darko Marinov (marinov(AT)lcs.mit.edu), May 17 2001
|
|
EXAMPLE
|
1; 1,1; 1,2,1; 1,3,3; 1,4,6,3; ...
|
|
CROSSREFS
|
Cf. A026016.
Sequence in context: A029264 A124054 A082870 this_sequence A137171 A010356 A100640
Adjacent sequences: A026006 A026007 A026008 this_sequence A026010 A026011 A026012
|
|
KEYWORD
|
nonn,tabl,easy
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu)
|
|
|
Search completed in 0.002 seconds
|
