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.

A054110 Triangular array T(n,k): in Pascal's triangle, draw vertical lines through binomial(n-1,k-1) (if present) and binomial(n-1,k) (if present); then T(n,k) is the sum of binomial(i,j) that lie on or between the lines and not below binomial(n,k).

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 5
5 1
6 1
7 8
8 8
9 1
10 1
11 10
12 17
13 10
14 1
15 1
16 12
17 28
18 28
19 12
20 1
21 1
22 14
23 40
24 57
25 40
26 14
27 1
28 1
29 16
30 54
31 98
32 98
33 54
34 16
35 1
36 1
37 18
38 70
39 152
40 197
41 152
42 70
43 18
44 1
45 1
46 20
47 88
48 222
49 350
50 350
51 222
52 88
53 20
54 1
55 1
56 22
57 108
58 310
59 572
60 701
61 572
62 310
63 108

List of values

[1, 1, 1, 1, 5, 1, 1, 8, 8, 1, 1, 10, 17, 10, 1, 1, 12, 28, 28, 12, 1, 1, 14, 40, 57, 40, 14, 1, 1, 16, 54, 98, 98, 54, 16, 1, 1, 18, 70, 152, 197, 152, 70, 18, 1, 1, 20, 88, 222, 350, 350, 222, 88, 20, 1, 1, 22, 108, 310, 572, 701, 572, 310, 108]