cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A238121 Triangle read by rows: T(n,k) gives the number of ballot sequences of length n having exactly k descents, n>=0, 0<=k<=n.

Table of values

n a(n)
0 1
1 1
2 0
3 2
4 0
5 0
6 3
7 1
8 0
9 0
10 5
11 5
12 0
13 0
14 0
15 7
16 16
17 3
18 0
19 0
20 0
21 11
22 43
23 21
24 1
25 0
26 0
27 0
28 15
29 99
30 101
31 17
32 0
33 0
34 0
35 0
36 22
37 215
38 373
39 145
40 9
41 0
42 0
43 0
44 0
45 30
46 430
47 1174
48 836
49 146
50 4
51 0
52 0
53 0
54 0
55 42
56 834
57 3337
58 3846
59 1324
60 112
61 1
62 0
63 0
64 0
65 0
66 56
67 1529
68 8642
69 15002
70 8786
71 1615
72 66
73 0
74 0
75 0
76 0
77 0
78 77
79 2765
80 21148
81 52132
82 47013
83 15403
84 1582
85 32
86 0
87 0
88 0
89 0
90 0

List of values

[1, 1, 0, 2, 0, 0, 3, 1, 0, 0, 5, 5, 0, 0, 0, 7, 16, 3, 0, 0, 0, 11, 43, 21, 1, 0, 0, 0, 15, 99, 101, 17, 0, 0, 0, 0, 22, 215, 373, 145, 9, 0, 0, 0, 0, 30, 430, 1174, 836, 146, 4, 0, 0, 0, 0, 42, 834, 3337, 3846, 1324, 112, 1, 0, 0, 0, 0, 56, 1529, 8642, 15002, 8786, 1615, 66, 0, 0, 0, 0, 0, 77, 2765, 21148, 52132, 47013, 15403, 1582, 32, 0, 0, 0, 0, 0]