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.

A214613 Abelian complexity function of ordinary paperfolding word (A014707).

Table of values

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

List of values

[2, 3, 4, 3, 4, 5, 4, 3, 4, 5, 6, 5, 4, 5, 4, 3, 4, 5, 6, 5, 6, 7, 6, 5, 6, 5, 6, 5, 6, 5, 4, 3, 4, 5, 6, 5, 6, 7, 6, 5, 6, 7, 8, 7, 6, 7, 6, 5, 6, 7, 6, 5, 6, 7, 6, 5, 6, 7, 6, 5, 6, 5, 4, 3, 4, 5, 6, 5, 6, 7, 6, 5, 6, 7, 8, 7, 6, 7, 6, 5, 6, 7]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.