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.

A143291 Triangle T(n,k), n>=2, 0<=k<=n-2, read by rows: numbers of binary words of length n containing at least one subword 10^{k}1 and no subwords 10^{i}1 with i

Table of values

n a(n)
2 1
3 3
4 1
5 8
6 2
7 1
8 19
9 4
10 2
11 1
12 43
13 8
14 3
15 2
16 1
17 94
18 15
19 5
20 3
21 2
22 1
23 201
24 27
25 9
26 4
27 3
28 2
29 1
30 423
31 48
32 15
33 6
34 4
35 3
36 2
37 1
38 880
39 84
40 24
41 10
42 5
43 4
44 3
45 2
46 1
47 1815
48 145
49 38
50 16
51 7
52 5
53 4
54 3
55 2
56 1
57 3719
58 248
59 60
60 24
61 11
62 6
63 5
64 4
65 3
66 2
67 1
68 7582
69 421
70 94
71 35
72 17
73 8
74 6
75 5
76 4
77 3
78 2
79 1
80 15397
81 710
82 146
83 51
84 25
85 12
86 7
87 6
88 5
89 4
90 3
91 2
92 1

List of values

[1, 3, 1, 8, 2, 1, 19, 4, 2, 1, 43, 8, 3, 2, 1, 94, 15, 5, 3, 2, 1, 201, 27, 9, 4, 3, 2, 1, 423, 48, 15, 6, 4, 3, 2, 1, 880, 84, 24, 10, 5, 4, 3, 2, 1, 1815, 145, 38, 16, 7, 5, 4, 3, 2, 1, 3719, 248, 60, 24, 11, 6, 5, 4, 3, 2, 1, 7582, 421, 94, 35, 17, 8, 6, 5, 4, 3, 2, 1, 15397, 710, 146, 51, 25, 12, 7, 6, 5, 4, 3, 2, 1]