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.

A051168 Triangular array T(h,k) for 0 <= k <= h read by rows: T(h,k) = number of binary Lyndon words with k ones and h-k zeros.

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

List of values

[1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 2, 2, 1, 0, 0, 1, 2, 3, 2, 1, 0, 0, 1, 3, 5, 5, 3, 1, 0, 0, 1, 3, 7, 8, 7, 3, 1, 0, 0, 1, 4, 9, 14, 14, 9, 4, 1, 0, 0, 1, 4, 12, 20, 25, 20, 12, 4, 1, 0, 0, 1, 5, 15, 30, 42, 42, 30, 15, 5, 1, 0, 0, 1, 5, 18, 40, 66, 75, 66, 40, 18, 5, 1, 0, 0, 1, 6]