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.

A110540 Invertible triangle: T(n,k) = number of k-ary Lyndon words of length n-k+1 with trace 1 modulo k.

Table of values

n a(n)
1 1
2 0
3 1
4 0
5 1
6 1
7 0
8 1
9 1
10 1
11 0
12 2
13 3
14 2
15 1
16 0
17 3
18 6
19 5
20 2
21 1
22 0
23 5
24 16
25 16
26 8
27 3
28 1
29 0
30 9
31 39
32 51
33 30
34 12
35 3
36 1
37 0
38 16
39 104
40 170
41 125
42 54
43 16
44 4
45 1
46 0
47 28
48 270
49 585
50 516
51 259
52 84
53 21
54 4
55 1
56 0
57 51
58 729
59 2048
60 2232
61 1296
62 480
63 128
64 27
65 5
66 1
67 0
68 93
69 1960
70 7280
71 9750
72 6665
73 2792
74 819
75 180
76 33
77 5
78 1

List of values

[1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 2, 3, 2, 1, 0, 3, 6, 5, 2, 1, 0, 5, 16, 16, 8, 3, 1, 0, 9, 39, 51, 30, 12, 3, 1, 0, 16, 104, 170, 125, 54, 16, 4, 1, 0, 28, 270, 585, 516, 259, 84, 21, 4, 1, 0, 51, 729, 2048, 2232, 1296, 480, 128, 27, 5, 1, 0, 93, 1960, 7280, 9750, 6665, 2792, 819, 180, 33, 5, 1]