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.

A349802 Triangle read by rows: T(n,k) is the number of binary Lyndon words of length n that begin with exactly k 0's. 0 <= k <= n.

Table of values

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

List of values

[1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 2, 2, 1, 1, 0, 0, 2, 3, 2, 1, 1, 0, 0, 4, 6, 4, 2, 1, 1, 0, 0, 5, 10, 7, 4, 2, 1, 1, 0, 0, 8, 18, 14, 8, 4, 2, 1, 1, 0, 0, 11, 31, 26, 15, 8, 4, 2, 1, 1, 0, 0, 18, 56, 50, 30, 16, 8, 4, 2, 1, 1, 0]