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.

A060277 Number of m for which a+b+c = n; abc = m has at least two distinct solutions (a,b,c) with 1 <= a <= b <= c.

Table of values

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

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 0, 1, 1, 0, 1, 1, 3, 1, 1, 1, 1, 3, 2, 7, 3, 2, 5, 4, 3, 5, 9, 2, 5, 6, 9, 5, 9, 14, 9, 7, 5, 10, 10, 11, 18, 7, 11, 16, 14, 12, 12, 23, 19, 13, 18, 11, 20, 19, 32, 17, 21, 18, 25, 19, 21, 27, 22, 21, 31, 27, 24, 28, 42, 34, 33, 21, 28, 31, 35, 47]