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.

A319975 Smallest number of complexity n with respect to the operations {1, shift, multiply}.

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 5
6 6
7 7
8 10
9 11
10 14
11 19
12 22
13 23
14 38
15 43
16 58
17 59
18 89
19 107
20 134
21 167
22 179
23 263
24 347
25 383
26 537
27 713
28 719
29 1103
30 1319
31 1439
32 2099
33 2879
34 3833
35 4283
36 5939
37 6299
38 9059
39 12239
40 15118
41 19079
42 23039
43 26459
44 44879
45 49559
46 66239
47 78839
48 98999
49 137339

List of values

[1, 2, 3, 4, 5, 6, 7, 10, 11, 14, 19, 22, 23, 38, 43, 58, 59, 89, 107, 134, 167, 179, 263, 347, 383, 537, 713, 719, 1103, 1319, 1439, 2099, 2879, 3833, 4283, 5939, 6299, 9059, 12239, 15118, 19079, 23039, 26459, 44879, 49559, 66239, 78839, 98999, 137339]