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.

A282570 Number of ways to write n as an ordered sum of two multiplicatively perfect numbers (A007422).

Table of values

n a(n)
0 0
1 0
2 1
3 0
4 0
5 0
6 0
7 2
8 0
9 2
10 0
11 2
12 1
13 0
14 2
15 2
16 5
17 0
18 2
19 0
20 3
21 2
22 4
23 4
24 2
25 2
26 0
27 4
28 5
29 4
30 3
31 2
32 4
33 2
34 4
35 6
36 8
37 4
38 0
39 4
40 6
41 8
42 5
43 6
44 5
45 4
46 2
47 8
48 10
49 8
50 2
51 0
52 7
53 6
54 7
55 4
56 8
57 4
58 2
59 8
60 10
61 12
62 2
63 6
64 4
65 10
66 9
67 6
68 9
69 4
70 7
71 6
72 14
73 12
74 2
75 6
76 5
77 10
78 7
79 10
80 8
81 4
82 4
83 10
84 14
85 8
86 6
87 6
88 10
89 8
90 10
91 12
92 15
93 8
94 6
95 14

List of values

[0, 0, 1, 0, 0, 0, 0, 2, 0, 2, 0, 2, 1, 0, 2, 2, 5, 0, 2, 0, 3, 2, 4, 4, 2, 2, 0, 4, 5, 4, 3, 2, 4, 2, 4, 6, 8, 4, 0, 4, 6, 8, 5, 6, 5, 4, 2, 8, 10, 8, 2, 0, 7, 6, 7, 4, 8, 4, 2, 8, 10, 12, 2, 6, 4, 10, 9, 6, 9, 4, 7, 6, 14, 12, 2, 6, 5, 10, 7, 10, 8, 4, 4, 10, 14, 8, 6, 6, 10, 8, 10, 12, 15, 8, 6, 14]