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.

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

Table of values

n a(n)
1 10
2 11
3 13
4 16
5 20
6 25
7 31
8 38
9 46
10 55
11 64
12 74
13 85
14 97
15 110
16 124
17 139
18 155
19 172
20 190
21 208
22 227
23 247
24 268
25 290
26 313
27 337
28 362
29 388
30 415
31 442
32 470
33 499
34 529
35 560
36 592
37 625
38 659
39 694
40 730
41 766
42 803
43 841
44 880
45 920
46 961
47 1003
48 1046
49 1090
50 1135

List of values

[10, 11, 13, 16, 20, 25, 31, 38, 46, 55, 64, 74, 85, 97, 110, 124, 139, 155, 172, 190, 208, 227, 247, 268, 290, 313, 337, 362, 388, 415, 442, 470, 499, 529, 560, 592, 625, 659, 694, 730, 766, 803, 841, 880, 920, 961, 1003, 1046, 1090, 1135]