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.

A173076 Triangle T(n, k, q) = binomial(n, k) - 1 + q^(floor(n/2))*binomial(n-2, k-1) with T(n, 0, q) = T(n, n, q) = 1 and q = 2, read by rows.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 3
5 1
6 1
7 4
8 4
9 1
10 1
11 7
12 13
13 7
14 1
15 1
16 8
17 21
18 21
19 8
20 1
21 1
22 13
23 46
24 67
25 46
26 13
27 1
28 1
29 14
30 60
31 114
32 114
33 60
34 14
35 1
36 1
37 23
38 123
39 295
40 389
41 295
42 123
43 23
44 1
45 1
46 24
47 147
48 419
49 685
50 685
51 419
52 147
53 24
54 1
55 1
56 41
57 300
58 1015
59 2001
60 2491
61 2001
62 1015
63 300
64 41
65 1

List of values

[1, 1, 1, 1, 3, 1, 1, 4, 4, 1, 1, 7, 13, 7, 1, 1, 8, 21, 21, 8, 1, 1, 13, 46, 67, 46, 13, 1, 1, 14, 60, 114, 114, 60, 14, 1, 1, 23, 123, 295, 389, 295, 123, 23, 1, 1, 24, 147, 419, 685, 685, 419, 147, 24, 1, 1, 41, 300, 1015, 2001, 2491, 2001, 1015, 300, 41, 1]