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.

A337854 a(n) is the smallest number that can be partitioned in exactly n ways as the sum of two Niven numbers.

Table of values

n a(n)
0 0
1 2
2 4
3 6
4 8
5 10
6 51
7 48
8 72
9 108
10 126
11 90
12 138
13 144
14 120
15 198
16 162
17 210
18 216
19 315
20 240
21 234
22 306
23 252
24 372
25 270
26 546
27 360
28 342
29 444
30 414
31 468
32 420
33 642
34 450
35 522
36 540
37 924
38 612
39 600
40 666
41 630
42 888
43 930
44 756
45 840
46 882
47 936
48 972
49 1098
50 1215
51 1026
52 1212
53 1080

List of values

[0, 2, 4, 6, 8, 10, 51, 48, 72, 108, 126, 90, 138, 144, 120, 198, 162, 210, 216, 315, 240, 234, 306, 252, 372, 270, 546, 360, 342, 444, 414, 468, 420, 642, 450, 522, 540, 924, 612, 600, 666, 630, 888, 930, 756, 840, 882, 936, 972, 1098, 1215, 1026, 1212, 1080]