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.

A003037 Smallest number of complexity n: smallest number requiring n 1's to build using +, * and ^.

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 5
6 7
7 11
8 13
9 21
10 23
11 41
12 43
13 71
14 94
15 139
16 211
17 215
18 431
19 863
20 1437
21 1868
22 2855
23 5737
24 8935
25 15838
26 15839
27 54357
28 95597
29 139117
30 233195
31 470399
32 1228247
33 2183791
34 4388063
35 6945587
36 13431919
37 32329439
38 46551023

List of values

[1, 2, 3, 4, 5, 7, 11, 13, 21, 23, 41, 43, 71, 94, 139, 211, 215, 431, 863, 1437, 1868, 2855, 5737, 8935, 15838, 15839, 54357, 95597, 139117, 233195, 470399, 1228247, 2183791, 4388063, 6945587, 13431919, 32329439, 46551023]