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.

A238123 Triangle read by rows: T(n,k) gives the number of ballot sequences of length n having k largest parts, n >= k >= 0.

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 1
5 1
6 0
7 3
8 0
9 1
10 0
11 7
12 2
13 0
14 1
15 0
16 20
17 5
18 0
19 0
20 1
21 0
22 56
23 14
24 5
25 0
26 0
27 1
28 0
29 182
30 35
31 14
32 0
33 0
34 0
35 1
36 0
37 589
38 132
39 28
40 14
41 0
42 0
43 0
44 1
45 0
46 2088
47 399
48 90
49 42
50 0
51 0
52 0
53 0
54 1
55 0
56 7522
57 1556
58 285
59 90
60 42
61 0
62 0
63 0
64 0
65 1
66 0
67 28820
68 5346
69 1232
70 165
71 132
72 0
73 0
74 0
75 0
76 0
77 1

List of values

[1, 0, 1, 0, 1, 1, 0, 3, 0, 1, 0, 7, 2, 0, 1, 0, 20, 5, 0, 0, 1, 0, 56, 14, 5, 0, 0, 1, 0, 182, 35, 14, 0, 0, 0, 1, 0, 589, 132, 28, 14, 0, 0, 0, 1, 0, 2088, 399, 90, 42, 0, 0, 0, 0, 1, 0, 7522, 1556, 285, 90, 42, 0, 0, 0, 0, 1, 0, 28820, 5346, 1232, 165, 132, 0, 0, 0, 0, 0, 1]