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.

A340458 Minimum length of the string over the alphabet of 3 or more symbols that has exactly n substring palindromes. Substrings are counted as distinct if they start at different offsets.

Table of values

n a(n)
1 1
2 2
3 2
4 3
5 4
6 3
7 4
8 5
9 5
10 4
11 5
12 6
13 6
14 7
15 5
16 6
17 7
18 7
19 8
20 8
21 6
22 7
23 8
24 8
25 9
26 9
27 9
28 7
29 8
30 9
31 9
32 10
33 10
34 10
35 11
36 8
37 9
38 10
39 10
40 11
41 11
42 11
43 12
44 12
45 9
46 10
47 11
48 11
49 12
50 12
51 12
52 13
53 13
54 14
55 10
56 11
57 12
58 12
59 13
60 13
61 13
62 14
63 14
64 15
65 14
66 11
67 12
68 13
69 13
70 14
71 14
72 14
73 15
74 15
75 16
76 15
77 16
78 12
79 13
80 14
81 14
82 15
83 15
84 15
85 16
86 16
87 17
88 16
89 17
90 17

List of values

[1, 2, 2, 3, 4, 3, 4, 5, 5, 4, 5, 6, 6, 7, 5, 6, 7, 7, 8, 8, 6, 7, 8, 8, 9, 9, 9, 7, 8, 9, 9, 10, 10, 10, 11, 8, 9, 10, 10, 11, 11, 11, 12, 12, 9, 10, 11, 11, 12, 12, 12, 13, 13, 14, 10, 11, 12, 12, 13, 13, 13, 14, 14, 15, 14, 11, 12, 13, 13, 14, 14, 14, 15, 15, 16, 15, 16, 12, 13, 14, 14, 15, 15, 15, 16, 16, 17, 16, 17, 17]