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.

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

Table of values

n a(n)
1 2
2 3
3 4
4 6
5 8
6 11
7 14
8 18
9 22
10 27
11 32
12 38
13 44
14 51
15 58
16 66
17 74
18 83
19 92
20 102
21 112
22 123
23 134
24 146
25 158
26 171
27 184
28 198
29 212
30 227
31 242
32 258
33 274
34 291
35 308
36 326
37 344
38 363
39 382
40 402
41 422
42 443
43 464
44 486
45 508
46 531
47 554
48 578
49 602
50 627
51 652
52 678
53 704
54 731
55 758

List of values

[2, 3, 4, 6, 8, 11, 14, 18, 22, 27, 32, 38, 44, 51, 58, 66, 74, 83, 92, 102, 112, 123, 134, 146, 158, 171, 184, 198, 212, 227, 242, 258, 274, 291, 308, 326, 344, 363, 382, 402, 422, 443, 464, 486, 508, 531, 554, 578, 602, 627, 652, 678, 704, 731, 758]