A230514 - cp's OEIS frontend

A230514 Number of ways to write n = a + b + c (0 < a <= b <= c) such that all the three numbers a(a+1)-1, b(b+1)-1, c*(c+1)-1 are Sophie Germain primes.

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

[0, 0, 0, 0, 0, 1, 1, 1, 2, 2, 2, 2, 3, 3, 4, 3, 4, 3, 4, 4, 4, 3, 5, 4, 4, 4, 5, 4, 4, 2, 4, 4, 4, 2, 3, 2, 3, 2, 1, 2, 2, 3, 3, 3, 4, 5, 3, 2, 5, 6, 5, 5, 6, 5, 7, 9, 6, 7, 9, 9, 8, 10, 8, 8, 10, 7, 8, 10, 6, 9, 8, 6, 5, 8, 4, 7, 4, 4, 8, 7, 5, 3, 5, 3, 7, 3, 3, 5, 7, 5, 4, 6, 5, 6, 7, 5, 6, 10, 9, 6]

cp's OEIS Frontend

A230514 Number of ways to write n = a + b + c (0 < a <= b <= c) such that all the three numbers a(a+1)-1, b(b+1)-1, c*(c+1)-1 are Sophie Germain primes.

Table of values

List of values

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

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

cp's OEIS Frontend

A230514 Number of ways to write n = a + b + c (0 < a <= b <= c) such that all the three numbers a*(a+1)-1, b*(b+1)-1, c*(c+1)-1 are Sophie Germain primes.

Table of values

List of values

A230514 Number of ways to write n = a + b + c (0 < a <= b <= c) such that all the three numbers a(a+1)-1, b(b+1)-1, c*(c+1)-1 are Sophie Germain primes.

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