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.

A306210 T(n,k) = binomial(n + k, n) - binomial(n + floor(k/2), n) + 1, square array read by descending antidiagonals (n >= 0, k >= 0).

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 1
6 1
7 2
8 3
9 1
10 1
11 3
12 4
13 4
14 1
15 1
16 3
17 8
18 7
19 5
20 1
21 1
22 4
23 10
24 17
25 11
26 6
27 1
28 1
29 4
30 16
31 26
32 31
33 16
34 7
35 1
36 1
37 5
38 19
39 47
40 56
41 51
42 22
43 8
44 1
45 1
46 5
47 27
48 65
49 112
50 106
51 78
52 29
53 9
54 1
55 1
56 6
57 31
58 101
59 176
60 232
61 183
62 113
63 37
64 10
65 1
66 1
67 6
68 41
69 131
70 296
71 407
72 435
73 295
74 157
75 46
76 11
77 1

List of values

[1, 1, 1, 1, 2, 1, 1, 2, 3, 1, 1, 3, 4, 4, 1, 1, 3, 8, 7, 5, 1, 1, 4, 10, 17, 11, 6, 1, 1, 4, 16, 26, 31, 16, 7, 1, 1, 5, 19, 47, 56, 51, 22, 8, 1, 1, 5, 27, 65, 112, 106, 78, 29, 9, 1, 1, 6, 31, 101, 176, 232, 183, 113, 37, 10, 1, 1, 6, 41, 131, 296, 407, 435, 295, 157, 46, 11, 1]