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.

A123223 Triangle read by rows: T(n,k) = number of ternary Lyndon words of length n with exactly k 1's.

Table of values

n a(n)
0 1
1 2
2 1
3 1
4 2
5 0
6 2
7 4
8 2
9 0
10 3
11 8
12 5
13 2
14 0
15 6
16 16
17 16
18 8
19 2
20 0
21 9
22 32
23 38
24 26
25 9
26 2
27 0
28 18
29 64
30 96
31 80
32 40
33 12
34 2
35 0
36 30
37 128
38 220
39 224
40 137
41 56
42 13
43 2
44 0
45 56
46 256
47 512
48 596
49 448
50 224
51 74
52 16
53 2
54 0
55 99
56 512
57 1144
58 1536
59 1336
60 806
61 332
62 96
63 17
64 2
65 0
66 186
67 1024
68 2560
69 3840
70 3840

List of values

[1, 2, 1, 1, 2, 0, 2, 4, 2, 0, 3, 8, 5, 2, 0, 6, 16, 16, 8, 2, 0, 9, 32, 38, 26, 9, 2, 0, 18, 64, 96, 80, 40, 12, 2, 0, 30, 128, 220, 224, 137, 56, 13, 2, 0, 56, 256, 512, 596, 448, 224, 74, 16, 2, 0, 99, 512, 1144, 1536, 1336, 806, 332, 96, 17, 2, 0, 186, 1024, 2560, 3840, 3840]