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.

A030058 Least non-sum of divisors of n for some n >= 1.

Table of values

n a(n)
1 2
2 4
3 8
4 13
5 16
6 29
7 32
8 40
9 43
10 57
11 61
12 64
13 73
14 91
15 92
16 97
17 121
18 125
19 128
20 145
21 169
22 181
23 187
24 196
25 211
26 218
27 225
28 235
29 249
30 253
31 256
32 281
33 313
34 337
35 361
36 364
37 373
38 379
39 393
40 400
41 404
42 435
43 466
44 469
45 481
46 505
47 509
48 512
49 547
50 559
51 561
52 577
53 589

List of values

[2, 4, 8, 13, 16, 29, 32, 40, 43, 57, 61, 64, 73, 91, 92, 97, 121, 125, 128, 145, 169, 181, 187, 196, 211, 218, 225, 235, 249, 253, 256, 281, 313, 337, 361, 364, 373, 379, 393, 400, 404, 435, 466, 469, 481, 505, 509, 512, 547, 559, 561, 577, 589]