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.

A351356 Triangle read by rows T(n,k): number of binary necklaces with n beads, k of them black, and at least two consecutive black beads.

Table of values

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

List of values

[0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 2, 1, 1, 0, 0, 1, 3, 3, 1, 1, 0, 0, 1, 4, 5, 3, 1, 1, 0, 0, 1, 5, 9, 7, 4, 1, 1, 0, 0, 1, 6, 13, 14, 10, 4, 1, 1, 0, 0, 1, 7, 19, 25, 22, 12, 5, 1, 1, 0, 0, 1, 8, 25, 41, 42, 30, 15, 5, 1, 1, 0, 0, 1, 9, 33, 63, 79, 66, 43, 19, 6, 1, 1, 0, 0, 1, 10, 41, 92, 131, 132, 99, 55, 22, 6, 1, 1]