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.

A271382 Least k with precisely n partitions k = x + y satisfying d(k) = d(x) + d(y), where d(k) is the number of divisors of k.

Table of values

n a(n)
1 2
2 14
3 10
4 26
5 44
6 45
7 126
8 68
9 99
10 104
11 162
12 117
13 98
14 124
15 232
16 164
17 148
18 200
19 260
20 333
21 231
22 244
23 248
24 297
25 273
26 284
27 315
28 406
29 332
30 345
31 385
32 430
33 344
34 399
35 388
36 436
37 429
38 488
39 465
40 495
41 472
42 525
43 561
44 555
45 621
46 556
47 632
48 604
49 652
50 712
51 536
52 693
53 735
54 675

List of values

[2, 14, 10, 26, 44, 45, 126, 68, 99, 104, 162, 117, 98, 124, 232, 164, 148, 200, 260, 333, 231, 244, 248, 297, 273, 284, 315, 406, 332, 345, 385, 430, 344, 399, 388, 436, 429, 488, 465, 495, 472, 525, 561, 555, 621, 556, 632, 604, 652, 712, 536, 693, 735, 675]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.