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.

A159916 Triangle T(m,n) = number of subsets of {1,...,m} with n elements having an odd sum, 1 <= n <= m.

Table of values

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

List of values

[1, 1, 1, 2, 2, 0, 2, 4, 2, 0, 3, 6, 4, 2, 1, 3, 9, 10, 6, 3, 1, 4, 12, 16, 16, 12, 4, 0, 4, 16, 28, 32, 28, 16, 4, 0, 5, 20, 40, 60, 66, 44, 16, 4, 1, 5, 25, 60, 100, 126, 110, 60, 20, 5, 1, 6, 30, 80, 160, 236, 236, 160, 80, 30, 6, 0, 6, 36, 110, 240, 396, 472, 396, 240, 110, 36, 6, 0]