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.

A376789 Table read by antidiagonals: T(n,k) is the number of Lyndon words of length k on the alphabet {0,1} whose prefix is the bitwise complement of the binary expansion of n with n >= 1 and k >= 1.

Table of values

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

List of values

[1, 1, 0, 2, 1, 0, 3, 1, 0, 0, 6, 1, 1, 0, 0, 9, 2, 2, 1, 0, 0, 18, 2, 4, 1, 0, 0, 0, 30, 4, 7, 1, 0, 1, 0, 0, 56, 5, 14, 1, 1, 1, 0, 0, 0, 99, 8, 25, 2, 1, 2, 1, 0, 0, 0, 186, 11, 48, 2, 2, 3, 2, 1, 0, 0, 0, 335, 18, 88, 3, 3, 6, 4, 1, 0, 0, 0, 0]