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.

A169945 Consider the 2^(n+1) polynomials f(x) with coefficients 0 or 1 and degree <= n. Sequence gives triangle read by rows, in which T(n,k) (n>=0) is the number of such polynomials of thickness k (0 <= k <= n+1).

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 1
5 1
6 3
7 3
8 1
9 1
10 4
11 8
12 2
13 1
14 1
15 5
16 16
17 6
18 3
19 1
20 1
21 6
22 29
23 14
24 11
25 2
26 1
27 1
28 7
29 49
30 29
31 29
32 9
33 3
34 1
35 1
36 8
37 82
38 52
39 74
40 22
41 14
42 2
43 1
44 1
45 9
46 130
47 96
48 160
49 58
50 42
51 12
52 3
53 1
54 1
55 10
56 205
57 160
58 344
59 128
60 126
61 30
62 17
63 2
64 1
65 1
66 11
67 305
68 277
69 676
70 294
71 314
72 98
73 53
74 15
75 3
76 1

List of values

[1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 4, 8, 2, 1, 1, 5, 16, 6, 3, 1, 1, 6, 29, 14, 11, 2, 1, 1, 7, 49, 29, 29, 9, 3, 1, 1, 8, 82, 52, 74, 22, 14, 2, 1, 1, 9, 130, 96, 160, 58, 42, 12, 3, 1, 1, 10, 205, 160, 344, 128, 126, 30, 17, 2, 1, 1, 11, 305, 277, 676, 294, 314, 98, 53, 15, 3, 1]