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.

A290744 Maximum number of distinct Lyndon factors that can appear in words of length n over an alphabet of size 5.

Table of values

n a(n)
1 5
2 6
3 8
4 11
5 15
6 19
7 24
8 30
9 37
10 45
11 53
12 62
13 72
14 83
15 95
16 107
17 120
18 134
19 149
20 165
21 181
22 198
23 216
24 235
25 255
26 275
27 296
28 318
29 341
30 365
31 389
32 414
33 440
34 467
35 495
36 523
37 552
38 582
39 613
40 645
41 677
42 710
43 744
44 779
45 815
46 851
47 888
48 926
49 965
50 1005
51 1045
52 1086
53 1128
54 1171
55 1215

List of values

[5, 6, 8, 11, 15, 19, 24, 30, 37, 45, 53, 62, 72, 83, 95, 107, 120, 134, 149, 165, 181, 198, 216, 235, 255, 275, 296, 318, 341, 365, 389, 414, 440, 467, 495, 523, 552, 582, 613, 645, 677, 710, 744, 779, 815, 851, 888, 926, 965, 1005, 1045, 1086, 1128, 1171, 1215]