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.

A268084 Minimum number of occurrences of abelian squares in a binary word of length n.

Table of values

n a(n)
1 0
2 0
3 0
4 1
5 2
6 3
7 4
8 4
9 5
10 6
11 7
12 8
13 10
14 11
15 12
16 14
17 15
18 17
19 18
20 20
21 21
22 23
23 24
24 26
25 28
26 29
27 30
28 32
29 34
30 35
31 37
32 39
33 41
34 43
35 44

List of values

[0, 0, 0, 1, 2, 3, 4, 4, 5, 6, 7, 8, 10, 11, 12, 14, 15, 17, 18, 20, 21, 23, 24, 26, 28, 29, 30, 32, 34, 35, 37, 39, 41, 43, 44]