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.

A358512 a(n) is the smallest number k with exactly n divisors that can be written in the form m + digsum(m), for some m (A176995).

Table of values

n a(n)
0 1
1 2
2 4
3 8
4 12
5 30
6 24
7 80
8 48
9 72
10 96
11 192
12 120
13 180
14 288
15 612
16 240
17 624
18 420
19 360
20 480
21 900
22 1632
23 960
24 1200
25 720
26 840
27 1560
28 2100
29 1260
30 1440
31 3420
32 2640
33 3024
34 1680
35 2880
36 8316
37 4620
38 3600
39 3780
40 4200
41 2520
42 3360
43 6240
44 9900
45 6300
46 7200
47 8640
48 6720
49 13200
50 7920

List of values

[1, 2, 4, 8, 12, 30, 24, 80, 48, 72, 96, 192, 120, 180, 288, 612, 240, 624, 420, 360, 480, 900, 1632, 960, 1200, 720, 840, 1560, 2100, 1260, 1440, 3420, 2640, 3024, 1680, 2880, 8316, 4620, 3600, 3780, 4200, 2520, 3360, 6240, 9900, 6300, 7200, 8640, 6720, 13200, 7920]