A303949 - cp's OEIS frontend

A303949 Number of ways to write 2n+1 as p + 2(2^k+5^m) with p prime and 2^k+5^m a product of at most three distinct primes, where k and m are nonnegative integers.

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

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

cp's OEIS Frontend

A303949 Number of ways to write 2n+1 as p + 2(2^k+5^m) with p prime and 2^k+5^m a product of at most three distinct primes, where k and m are nonnegative integers.

Table of values

List of values

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

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

cp's OEIS Frontend

A303949 Number of ways to write 2*n+1 as p + 2*(2^k+5^m) with p prime and 2^k+5^m a product of at most three distinct primes, where k and m are nonnegative integers.

Table of values

List of values

A303949 Number of ways to write 2n+1 as p + 2(2^k+5^m) with p prime and 2^k+5^m a product of at most three distinct primes, where k and m are nonnegative integers.

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