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.

A119458 Triangle read by rows: T(n,k) is the number of (marked) circular binary words of length n having k occurrences of 00 (0 <= k <= n).

Table of values

n a(n)
0 1
1 1
2 1
3 3
4 0
5 1
6 4
7 3
8 0
9 1
10 7
11 4
12 4
13 0
14 1
15 11
16 10
17 5
18 5
19 0
20 1
21 18
22 18
23 15
24 6
25 6
26 0
27 1
28 29
29 35
30 28
31 21
32 7
33 7
34 0
35 1
36 47
37 64
38 60
39 40
40 28
41 8
42 8
43 0
44 1
45 76
46 117
47 117
48 93
49 54
50 36
51 9
52 9
53 0
54 1
55 123
56 210
57 230
58 190
59 135
60 70
61 45
62 10
63 10
64 0
65 1
66 199
67 374
68 440
69 396
70 286
71 187
72 88
73 55
74 11
75 11
76 0
77 1

List of values

[1, 1, 1, 3, 0, 1, 4, 3, 0, 1, 7, 4, 4, 0, 1, 11, 10, 5, 5, 0, 1, 18, 18, 15, 6, 6, 0, 1, 29, 35, 28, 21, 7, 7, 0, 1, 47, 64, 60, 40, 28, 8, 8, 0, 1, 76, 117, 117, 93, 54, 36, 9, 9, 0, 1, 123, 210, 230, 190, 135, 70, 45, 10, 10, 0, 1, 199, 374, 440, 396, 286, 187, 88, 55, 11, 11, 0, 1]