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.

A320341 Triangle read by rows: T(n,k) is the number of unmarked circular binary words (necklaces) of length n having k occurrences of the pattern 00 (n >= 0 and 0 <= k <= n).

Table of values

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

List of values

[1, 1, 1, 2, 0, 1, 2, 1, 0, 1, 3, 1, 1, 0, 1, 3, 2, 1, 1, 0, 1, 5, 3, 3, 1, 1, 0, 1, 5, 5, 4, 3, 1, 1, 0, 1, 8, 8, 8, 5, 4, 1, 1, 0, 1, 10, 13, 13, 11, 6, 4, 1, 1, 0, 1, 15, 21, 24, 19, 14, 7, 5, 1, 1, 0, 1, 19, 34, 40, 36, 26, 17, 8, 5, 1, 1, 0, 1, 31, 55, 71, 67, 54, 34, 22, 9, 6, 1, 1, 0, 1]