A230451 - cp's OEIS frontend

A230451 Number of ways to write n = x + y + z (x, y, z > 0) such that 2x + 1, 2y + 3, 2z + 5 are all prime and xy*z is a triangular number.

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

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

cp's OEIS Frontend

A230451 Number of ways to write n = x + y + z (x, y, z > 0) such that 2x + 1, 2y + 3, 2z + 5 are all prime and xy*z is a triangular number.

Table of values

List of values

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

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

cp's OEIS Frontend

A230451 Number of ways to write n = x + y + z (x, y, z > 0) such that 2*x + 1, 2*y + 3, 2*z + 5 are all prime and x*y*z is a triangular number.

Table of values

List of values

A230451 Number of ways to write n = x + y + z (x, y, z > 0) such that 2x + 1, 2y + 3, 2z + 5 are all prime and xy*z is a triangular number.

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