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.

A189825 Least number k such that d(k-1) + d(k+1) = n, where d(k) is the number of divisors of k.

Table of values

n a(n)
3 2
4 4
5 3
6 14
7 5
8 7
9 15
10 11
11 17
12 19
13 35
14 29
15 65
16 41
17 101
18 79
19 143
20 71
21 197
22 161
23 323
24 169
25 2917
26 181
27 577
28 239
29 575
30 629
31 899
32 419
33 1297
34 701
35 901
36 721
37 25599
38 881
39 5183
40 1121
41 9215
42 2351
43 4901
44 1079
45 107585
46 1681
47 36863
48 2159
49 3601
50 2881
51 11663
52 2519

List of values

[2, 4, 3, 14, 5, 7, 15, 11, 17, 19, 35, 29, 65, 41, 101, 79, 143, 71, 197, 161, 323, 169, 2917, 181, 577, 239, 575, 629, 899, 419, 1297, 701, 901, 721, 25599, 881, 5183, 1121, 9215, 2351, 4901, 1079, 107585, 1681, 36863, 2159, 3601, 2881, 11663, 2519]