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.

A169950 Consider the 2^n monic 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 (1 <= k <= n+1).

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 1
6 1
7 5
8 1
9 1
10 1
11 8
12 4
13 2
14 1
15 1
16 13
17 8
18 8
19 1
20 1
21 1
22 20
23 15
24 18
25 7
26 2
27 1
28 1
29 33
30 23
31 45
32 13
33 11
34 1
35 1
36 1
37 48
38 44
39 86
40 36
41 28
42 10
43 2
44 1
45 1
46 75
47 64
48 184
49 70
50 84
51 18
52 14
53 1
54 1
55 1
56 100
57 117
58 332
59 166
60 188
61 68
62 36
63 13
64 2
65 1
66 1
67 145
68 173
69 657
70 282
71 482
72 134
73 132
74 23
75 17
76 1
77 1

List of values

[1, 1, 1, 1, 2, 1, 1, 5, 1, 1, 1, 8, 4, 2, 1, 1, 13, 8, 8, 1, 1, 1, 20, 15, 18, 7, 2, 1, 1, 33, 23, 45, 13, 11, 1, 1, 1, 48, 44, 86, 36, 28, 10, 2, 1, 1, 75, 64, 184, 70, 84, 18, 14, 1, 1, 1, 100, 117, 332, 166, 188, 68, 36, 13, 2, 1, 1, 145, 173, 657, 282, 482, 134, 132, 23, 17, 1, 1]