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.

A039754 Irregular triangle read by rows: T(n,k) = number of binary codes of length n with k words (n >= 0, 0 <= k <= 2^n); also number of 0/1-polytopes with vertices from the unit n-cube; also number of inequivalent Boolean functions of n variables with exactly k nonzero values under action of Jevons group.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 1
6 1
7 2
8 1
9 1
10 1
11 1
12 3
13 3
14 6
15 3
16 3
17 1
18 1
19 1
20 1
21 4
22 6
23 19
24 27
25 50
26 56
27 74
28 56
29 50
30 27
31 19
32 6
33 4
34 1
35 1
36 1
37 1
38 5
39 10
40 47
41 131
42 472
43 1326
44 3779
45 9013
46 19963
47 38073
48 65664
49 98804
50 133576
51 158658
52 169112
53 158658
54 133576
55 98804
56 65664
57 38073
58 19963
59 9013
60 3779
61 1326
62 472
63 131
64 47
65 10
66 5
67 1
68 1

List of values

[1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 3, 3, 6, 3, 3, 1, 1, 1, 1, 4, 6, 19, 27, 50, 56, 74, 56, 50, 27, 19, 6, 4, 1, 1, 1, 1, 5, 10, 47, 131, 472, 1326, 3779, 9013, 19963, 38073, 65664, 98804, 133576, 158658, 169112, 158658, 133576, 98804, 65664, 38073, 19963, 9013, 3779, 1326, 472, 131, 47, 10, 5, 1, 1]