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.

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

Table of values

n a(n)
1 1
2 1
3 1
4 3
5 0
6 1
7 3
8 3
9 1
10 1
11 5
12 4
13 6
14 0
15 1
16 7
17 7
18 10
19 6
20 1
21 1
22 13
23 8
24 27
25 6
26 9
27 0
28 1
29 15
30 21
31 41
32 23
33 17
34 9
35 1
36 1
37 27
38 20
39 98
40 34
41 56
42 8
43 12
44 0
45 1
46 25
47 53
48 148
49 96
50 104
51 50
52 22
53 12
54 1
55 1
56 45
57 56
58 325
59 116
60 294
61 66
62 96
63 10
64 15
65 0
66 1
67 59
68 89
69 487
70 319
71 518
72 262
73 184
74 86

List of values

[1, 1, 1, 3, 0, 1, 3, 3, 1, 1, 5, 4, 6, 0, 1, 7, 7, 10, 6, 1, 1, 13, 8, 27, 6, 9, 0, 1, 15, 21, 41, 23, 17, 9, 1, 1, 27, 20, 98, 34, 56, 8, 12, 0, 1, 25, 53, 148, 96, 104, 50, 22, 12, 1, 1, 45, 56, 325, 116, 294, 66, 96, 10, 15, 0, 1, 59, 89, 487, 319, 518, 262, 184, 86]