|
Search: id:A035317
|
|
| |
|
| 1, 1, 1, 1, 2, 2, 1, 3, 4, 2, 1, 4, 7, 6, 3, 1, 5, 11, 13, 9, 3, 1, 6, 16, 24, 22, 12, 4, 1, 7, 22, 40, 46, 34, 16, 4, 1, 8, 29, 62, 86, 80, 50, 20, 5, 1, 9, 37, 91, 148, 166, 130, 70, 25, 5, 1, 10, 46, 128, 239, 314, 296, 200, 95, 30, 6, 1, 11, 56, 174, 367, 553, 610, 496, 295, 125
(list; table; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
REFERENCES
|
E. Mendelsohn, Races with ties, Math. Mag. 55 (1982), 170-175.
|
|
FORMULA
|
Reference gives recurrence.
T(n, k)=if(k>n, 0, Sum {j=0..floor(n/2) binomial(n-2j, k-2j)} - Paul Barry (pbarry(AT)wit.ie), Feb 11 2003
|
|
EXAMPLE
|
1; 1,1; 1,2,2; 1,3,4,2; 1,4,7,6,3; 1,5,11,13,9,3; ...
|
|
CROSSREFS
|
Row sums are A000975, diagonal sums are A080239
Essentially the same as A059259 and A080242. Cf. A059260.
Adjacent sequences: A035314 A035315 A035316 this_sequence A035318 A035319 A035320
Sequence in context: A076019 A071453 A080242 this_sequence A103923 A061987 A105809
|
|
KEYWORD
|
nonn,easy,tabl,nice
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu)
|
|
|
Search completed in 0.002 seconds
|
