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.

A143328 Table T(n,k) read by antidiagonals. T(n,k) is the number of primitive (=aperiodic) k-ary Lyndon words (n,k >= 1) with length less than or equal to n.

Table of values

n a(n)
1 1
2 2
3 1
4 3
5 3
6 1
7 4
8 6
9 5
10 1
11 5
12 10
13 14
14 8
15 1
16 6
17 15
18 30
19 32
20 14
21 1
22 7
23 21
24 55
25 90
26 80
27 23
28 1
29 8
30 28
31 91
32 205
33 294
34 196
35 41
36 1
37 9
38 36
39 140
40 406
41 829
42 964
43 508
44 71
45 1
46 10
47 45
48 204
49 728
50 1960
51 3409
52 3304
53 1318
54 127
55 1
56 11
57 55
58 285
59 1212
60 4088
61 9695
62 14569
63 11464
64 3502
65 226
66 1

List of values

[1, 2, 1, 3, 3, 1, 4, 6, 5, 1, 5, 10, 14, 8, 1, 6, 15, 30, 32, 14, 1, 7, 21, 55, 90, 80, 23, 1, 8, 28, 91, 205, 294, 196, 41, 1, 9, 36, 140, 406, 829, 964, 508, 71, 1, 10, 45, 204, 728, 1960, 3409, 3304, 1318, 127, 1, 11, 55, 285, 1212, 4088, 9695, 14569, 11464, 3502, 226, 1]