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.

A359197 Least number k having n subsets of its divisors whose sum is k+1.

Table of values

n a(n)
0 1
1 2
2 18
3 12
4 162
5 24
6 342
7 80
8 36
9 198
10 156
11 48
12 126
13 150
14 1430
15 132
16 1110
17 1302
18 1672
19 448
20 90
21 96
22 784
23 1190
24 1408
25 84
26 320
27 72
28 1064
29 3100
30 16048
31 744
32 702
33 60
34 920
35 690
36 984
37 750
38 594
39 2300
40 714
41 696
42 11024
43 192
44 11696
45 400
46 2028
47 680
48 728
49 1548
50 10672
51 546
52 616
53 2156
54 462
55 324
56 37888
57 510
58 4698

List of values

[1, 2, 18, 12, 162, 24, 342, 80, 36, 198, 156, 48, 126, 150, 1430, 132, 1110, 1302, 1672, 448, 90, 96, 784, 1190, 1408, 84, 320, 72, 1064, 3100, 16048, 744, 702, 60, 920, 690, 984, 750, 594, 2300, 714, 696, 11024, 192, 11696, 400, 2028, 680, 728, 1548, 10672, 546, 616, 2156, 462, 324, 37888, 510, 4698]