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.

A378599 Numbers whose divisors can be partitioned into two disjoint sets with the same sum in an odd number of ways.

Table of values

n a(n)
1 6
2 12
3 20
4 24
5 28
6 30
7 48
8 56
9 60
10 70
11 80
12 88
13 90
14 96
15 104
16 140
17 156
18 168
19 176
20 180
21 192
22 208
23 210
24 216
25 224
26 234
27 252
28 270
29 272
30 280
31 300
32 304
33 312
34 320
35 336
36 350
37 352
38 360
39 368
40 384
41 396
42 408
43 420
44 432
45 448
46 464
47 468
48 476
49 480
50 496
51 504
52 532
53 550
54 552
55 560
56 612
57 630
58 644
59 650
60 696
61 700
62 720
63 728
64 736
65 760
66 768

List of values

[6, 12, 20, 24, 28, 30, 48, 56, 60, 70, 80, 88, 90, 96, 104, 140, 156, 168, 176, 180, 192, 208, 210, 216, 224, 234, 252, 270, 272, 280, 300, 304, 312, 320, 336, 350, 352, 360, 368, 384, 396, 408, 420, 432, 448, 464, 468, 476, 480, 496, 504, 532, 550, 552, 560, 612, 630, 644, 650, 696, 700, 720, 728, 736, 760, 768]