A228431 - cp's OEIS frontend

A228431 Number of ordered ways to write n = x + y (x, y > 0) with p(3, x) + p(6, y) prime, where p(3, k) denotes the triangular number k(k+1)/2 and p(6, k) denotes the hexagonal number k(2k-1) = p(3, 2k-1).

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

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

cp's OEIS Frontend

A228431 Number of ordered ways to write n = x + y (x, y > 0) with p(3, x) + p(6, y) prime, where p(3, k) denotes the triangular number k(k+1)/2 and p(6, k) denotes the hexagonal number k(2k-1) = p(3, 2k-1).

Table of values

List of values

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

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

cp's OEIS Frontend

A228431 Number of ordered ways to write n = x + y (x, y > 0) with p(3, x) + p(6, y) prime, where p(3, k) denotes the triangular number k*(k+1)/2 and p(6, k) denotes the hexagonal number k*(2*k-1) = p(3, 2*k-1).

Table of values

List of values

A228431 Number of ordered ways to write n = x + y (x, y > 0) with p(3, x) + p(6, y) prime, where p(3, k) denotes the triangular number k(k+1)/2 and p(6, k) denotes the hexagonal number k(2k-1) = p(3, 2k-1).

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