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.

A171855 Triangle read by rows: T(n,k) is the number of binary words of length n that have no pair of adjacent 1's and have k subwords 0000 (n>=0; k=0 for n=0,1,2; 0<=k<=n-3 for n>=3).

Table of values

n a(n)
0 1
1 2
2 3
3 5
4 7
5 1
6 10
7 2
8 1
9 15
10 3
11 2
12 1
13 22
14 6
15 3
16 2
17 1
18 32
19 11
20 6
21 3
22 2
23 1
24 47
25 18
26 12
27 6
28 3
29 2
30 1
31 69
32 30
33 20
34 13
35 6
36 3
37 2
38 1
39 101
40 50
41 34
42 22
43 14
44 6
45 3
46 2
47 1
48 148
49 81
50 59
51 38
52 24
53 15
54 6
55 3
56 2
57 1
58 217
59 130
60 99
61 68
62 42
63 26
64 16
65 6
66 3
67 2
68 1
69 318
70 208
71 163
72 118
73 77
74 46
75 28
76 17
77 6
78 3
79 2
80 1
81 466

List of values

[1, 2, 3, 5, 7, 1, 10, 2, 1, 15, 3, 2, 1, 22, 6, 3, 2, 1, 32, 11, 6, 3, 2, 1, 47, 18, 12, 6, 3, 2, 1, 69, 30, 20, 13, 6, 3, 2, 1, 101, 50, 34, 22, 14, 6, 3, 2, 1, 148, 81, 59, 38, 24, 15, 6, 3, 2, 1, 217, 130, 99, 68, 42, 26, 16, 6, 3, 2, 1, 318, 208, 163, 118, 77, 46, 28, 17, 6, 3, 2, 1, 466]