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.

A074650 Table T(n,k) read by downward antidiagonals: number of Lyndon words (aperiodic necklaces) with n beads of k colors, n >= 1, k >= 1.

Table of values

n a(n)
1 1
2 2
3 0
4 3
5 1
6 0
7 4
8 3
9 2
10 0
11 5
12 6
13 8
14 3
15 0
16 6
17 10
18 20
19 18
20 6
21 0
22 7
23 15
24 40
25 60
26 48
27 9
28 0
29 8
30 21
31 70
32 150
33 204
34 116
35 18
36 0
37 9
38 28
39 112
40 315
41 624
42 670
43 312
44 30
45 0
46 10
47 36
48 168
49 588
50 1554
51 2580
52 2340
53 810
54 56
55 0
56 11
57 45
58 240
59 1008
60 3360
61 7735
62 11160
63 8160
64 2184
65 99
66 0

List of values

[1, 2, 0, 3, 1, 0, 4, 3, 2, 0, 5, 6, 8, 3, 0, 6, 10, 20, 18, 6, 0, 7, 15, 40, 60, 48, 9, 0, 8, 21, 70, 150, 204, 116, 18, 0, 9, 28, 112, 315, 624, 670, 312, 30, 0, 10, 36, 168, 588, 1554, 2580, 2340, 810, 56, 0, 11, 45, 240, 1008, 3360, 7735, 11160, 8160, 2184, 99, 0]