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.

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

Table of values

n a(n)
0 1
1 8
2 25
3 43
4 84
5 71
6 102
7 160
8 150
9 219
10 226
11 196
12 244
13 350
14 328
15 300
16 330
17 354
18 400
19 386
20 448
21 408
22 434
23 390
24 510
25 536
26 462
27 546
28 570
29 624
30 608
31 740
32 722
33 690
34 714
35 770
36 726
37 660
38 750
39 804
40 842
41 858
42 876
43 870
44 932
45 914
46 924
47 840
48 986
49 1038
50 966
51 1108
52 1050
53 1056

List of values

[1, 8, 25, 43, 84, 71, 102, 160, 150, 219, 226, 196, 244, 350, 328, 300, 330, 354, 400, 386, 448, 408, 434, 390, 510, 536, 462, 546, 570, 624, 608, 740, 722, 690, 714, 770, 726, 660, 750, 804, 842, 858, 876, 870, 932, 914, 924, 840, 986, 1038, 966, 1108, 1050, 1056]