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.

A296373 Triangle T(n,k) = number of compositions of n whose factorization into Lyndon words (aperiodic necklaces) is of length k.

Table of values

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

List of values

[1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 6, 5, 3, 1, 1, 9, 12, 6, 3, 1, 1, 18, 21, 14, 6, 3, 1, 1, 30, 45, 27, 15, 6, 3, 1, 1, 56, 84, 61, 29, 15, 6, 3, 1, 1, 99, 170, 120, 67, 30, 15, 6, 3, 1, 1, 186, 323, 254, 136, 69, 30, 15, 6, 3, 1, 1, 335, 640, 510, 295, 142, 70, 30, 15, 6, 3, 1, 1]