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.

A297053 Sum of the larger parts of the partitions of n into two parts such that the smaller part does not divide the larger.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 3
6 0
7 9
8 5
9 12
10 13
11 30
12 7
13 45
14 38
15 41
16 43
17 84
18 48
19 108
20 67
21 103
22 124
23 165
24 78
25 178
26 185
27 192
28 175
29 273
30 162
31 315
32 247
33 308
34 343
35 350
36 244
37 459
38 440
39 451
40 360
41 570
42 411
43 630
44 535
45 545
46 670
47 759
48 496
49 786
50 718
51 818
52 787
53 975
54 768
55 959
56 834
57 1042

List of values

[0, 0, 0, 0, 3, 0, 9, 5, 12, 13, 30, 7, 45, 38, 41, 43, 84, 48, 108, 67, 103, 124, 165, 78, 178, 185, 192, 175, 273, 162, 315, 247, 308, 343, 350, 244, 459, 440, 451, 360, 570, 411, 630, 535, 545, 670, 759, 496, 786, 718, 818, 787, 975, 768, 959, 834, 1042]