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.

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

Table of values

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

List of values

[1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 4, 7, 4, 1, 1, 5, 12, 12, 5, 1, 1, 6, 18, 25, 18, 6, 1, 1, 7, 25, 44, 44, 25, 7, 1, 1, 8, 33, 70, 89, 70, 33, 8, 1, 1, 9, 42, 104, 160, 160, 104, 42, 9, 1, 1, 10, 52, 147, 265, 321, 265, 147, 52, 10, 1]