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.

A298947 Number of integer partitions y of n such that exactly one permutation of y is a Lyndon word.

Table of values

n a(n)
1 1
2 1
3 2
4 3
5 6
6 7
7 11
8 12
9 15
10 19
11 22
12 22
13 29
14 32
15 32
16 38
17 42
18 44
19 49
20 51
21 54
22 63
23 63
24 64
25 71
26 79
27 76
28 84
29 87
30 90
31 96
32 101
33 101
34 113
35 108
36 115
37 122
38 131
39 125
40 134
41 138
42 144
43 147
44 155
45 150
46 169
47 163
48 168
49 173
50 185
51 180
52 194
53 191
54 200
55 198
56 211
57 209
58 227
59 218
60 224
61 231
62 246

List of values

[1, 1, 2, 3, 6, 7, 11, 12, 15, 19, 22, 22, 29, 32, 32, 38, 42, 44, 49, 51, 54, 63, 63, 64, 71, 79, 76, 84, 87, 90, 96, 101, 101, 113, 108, 115, 122, 131, 125, 134, 138, 144, 147, 155, 150, 169, 163, 168, 173, 185, 180, 194, 191, 200, 198, 211, 209, 227, 218, 224, 231, 246]