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.

A262265 Maximum possible number of inequivalent 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 4
8 6
9 6
10 7
11 8
12 10
13 10
14 11
15 12
16 15
17 16
18 17
19 17
20 19
21 21
22 22
23 23
24 25
25 26
26 28
27 29
28 31
29 32
30 34
31 36
32 37
33 39
34 41

List of values

[0, 1, 1, 2, 3, 4, 4, 6, 6, 7, 8, 10, 10, 11, 12, 15, 16, 17, 17, 19, 21, 22, 23, 25, 26, 28, 29, 31, 32, 34, 36, 37, 39, 41]