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.

A227877 Number of ways to write n = x + y + z (x, y, z > 0) such that x*y and x*z are triangular numbers, and 6*y-1 and 6*z+1 are both prime.

Table of values

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

List of values

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