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.

A262249 Maximum possible number of distinct abelian squares occurring in a binary word of length n.

Table of values

n a(n)
1 0
2 1
3 1
4 2
5 3
6 4
7 5
8 7
9 9
10 11
11 13
12 15
13 17
14 21
15 23
16 26
17 30
18 34
19 38
20 43
21 47
22 52
23 57
24 62
25 65
26 71
27 76
28 83
29 89
30 95
31 100
32 108
33 114
34 122

List of values

[0, 1, 1, 2, 3, 4, 5, 7, 9, 11, 13, 15, 17, 21, 23, 26, 30, 34, 38, 43, 47, 52, 57, 62, 65, 71, 76, 83, 89, 95, 100, 108, 114, 122]