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.

A065941 T(n,k) = binomial(n-floor((k+1)/2), floor(k/2)). Triangle read by rows, for 0 <= k <= n.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 1
6 1
7 1
8 2
9 1
10 1
11 1
12 3
13 2
14 1
15 1
16 1
17 4
18 3
19 3
20 1
21 1
22 1
23 5
24 4
25 6
26 3
27 1
28 1
29 1
30 6
31 5
32 10
33 6
34 4
35 1
36 1
37 1
38 7
39 6
40 15
41 10
42 10
43 4
44 1
45 1
46 1
47 8
48 7
49 21
50 15
51 20
52 10
53 5
54 1
55 1
56 1
57 9
58 8
59 28
60 21
61 35
62 20
63 15
64 5
65 1
66 1
67 1
68 10
69 9
70 36
71 28
72 56
73 35
74 35
75 15
76 6
77 1
78 1
79 1
80 11
81 10
82 45
83 36
84 84
85 56
86 70
87 35
88 21
89 6
90 1

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 2, 1, 1, 1, 4, 3, 3, 1, 1, 1, 5, 4, 6, 3, 1, 1, 1, 6, 5, 10, 6, 4, 1, 1, 1, 7, 6, 15, 10, 10, 4, 1, 1, 1, 8, 7, 21, 15, 20, 10, 5, 1, 1, 1, 9, 8, 28, 21, 35, 20, 15, 5, 1, 1, 1, 10, 9, 36, 28, 56, 35, 35, 15, 6, 1, 1, 1, 11, 10, 45, 36, 84, 56, 70, 35, 21, 6, 1]