A256707 - cp's OEIS frontend

A256707 Number of unordered ways to write n as the sum of two distinct elements of the set {floor(x/3): 3x-1 and 3x+1 are twin primes}.

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

[1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 3, 3, 3, 3, 3, 3, 3, 3, 4, 5, 4, 3, 5, 5, 5, 3, 3, 5, 5, 5, 5, 3, 5, 6, 5, 2, 3, 5, 6, 2, 1, 3, 7, 4, 3, 4, 5, 5, 5, 3, 5, 3, 4, 3, 3, 5, 4, 3, 3, 4, 5, 2, 5, 4, 5, 6, 4, 5, 6, 5, 7, 3, 4, 5, 4, 6, 3, 3, 4, 4, 5, 3, 3, 2, 5, 5, 2, 4, 6, 7, 7, 4, 6, 6, 6, 6, 3]

cp's OEIS Frontend

A256707 Number of unordered ways to write n as the sum of two distinct elements of the set {floor(x/3): 3x-1 and 3x+1 are twin primes}.

Table of values

List of values

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

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

cp's OEIS Frontend

A256707 Number of unordered ways to write n as the sum of two distinct elements of the set {floor(x/3): 3*x-1 and 3*x+1 are twin primes}.

Table of values

List of values

A256707 Number of unordered ways to write n as the sum of two distinct elements of the set {floor(x/3): 3x-1 and 3x+1 are twin primes}.

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