A134143 - cp's OEIS frontend

A134143 Let T(n) = (p, p+2) denote the n-th pair of twin primes. Let S(n) = 2p+2 (see A054735). Then a(n) = number of ways of writing S(n) as S(i) + S(j) with i <= j < m.

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

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

cp's OEIS Frontend

A134143 Let T(n) = (p, p+2) denote the n-th pair of twin primes. Let S(n) = 2p+2 (see A054735). Then a(n) = number of ways of writing S(n) as S(i) + S(j) with i <= j < m.

Table of values

List of values

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

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

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