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.

A005520 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 10
8 11
9 17
10 22
11 23
12 41
13 47
14 59
15 89
16 107
17 167
18 179
19 263
20 347
21 467
22 683
23 719
24 1223
25 1438
26 1439
27 2879
28 3767
29 4283
30 6299
31 10079
32 11807
33 15287
34 21599
35 33599
36 45197
37 56039
38 81647
39 98999
40 163259
41 203999
42 241883
43 371447
44 540539
45 590399
46 907199

List of values

[1, 2, 3, 4, 5, 7, 10, 11, 17, 22, 23, 41, 47, 59, 89, 107, 167, 179, 263, 347, 467, 683, 719, 1223, 1438, 1439, 2879, 3767, 4283, 6299, 10079, 11807, 15287, 21599, 33599, 45197, 56039, 81647, 98999, 163259, 203999, 241883, 371447, 540539, 590399, 907199]