A303702 - cp's OEIS frontend

A303702 Number of ways to write 2*n as p + 2^k + 3^m, where p is a prime, and k and m are nonnegative integers.

n	a(n)
1	0
2	1
3	2
4	3
5	4
6	5
7	5
8	7
9	6
10	6
11	9
12	9
13	5
14	8
15	9
16	6
17	9
18	11
19	8
20	10
21	11
22	7
23	12
24	15
25	8
26	10
27	12
28	7
29	10
30	9
31	8
32	12
33	11
34	5
35	12
36	16
37	7
38	13
39	17
40	8
41	10
42	15
43	10
44	13
45	14
46	10
47	12
48	17
49	7
50	12
51	18
52	11
53	13
54	17
55	10
56	13
57	20
58	11
59	14
60	17
61	8
62	10
63	16
64	7
65	10

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

cp's OEIS Frontend

A303702 Number of ways to write 2*n as p + 2^k + 3^m, where p is a prime, and k and m are nonnegative integers.

Table of values

List of values

n	a(n)
1	0
2	1
3	2
4	3
5	4
6	5
7	5
8	7
9	6
10	6
11	9
12	9
13	5
14	8
15	9
16	6
17	9
18	11
19	8
20	10
21	11
22	7
23	12
24	15
25	8
26	10
27	12
28	7
29	10
30	9
31	8
32	12
33	11
34	5
35	12
36	16
37	7
38	13
39	17
40	8
41	10
42	15
43	10
44	13
45	14
46	10
47	12
48	17
49	7
50	12
51	18
52	11
53	13
54	17
55	10
56	13
57	20
58	11
59	14
60	17
61	8
62	10
63	16
64	7
65	10

n	a(n)
1	0
2	1
3	2
4	3
5	4
6	5
7	5
8	7
9	6
10	6
11	9
12	9
13	5
14	8
15	9
16	6
17	9
18	11
19	8
20	10
21	11
22	7
23	12
24	15
25	8
26	10
27	12
28	7
29	10
30	9
31	8
32	12
33	11
34	5
35	12
36	16
37	7
38	13
39	17
40	8
41	10
42	15
43	10
44	13
45	14
46	10
47	12
48	17
49	7
50	12
51	18
52	11
53	13
54	17
55	10
56	13
57	20
58	11
59	14
60	17
61	8
62	10
63	16
64	7
65	10

n	a(n)
1	0
2	1
3	2
4	3
5	4
6	5
7	5
8	7
9	6
10	6
11	9
12	9
13	5
14	8
15	9
16	6
17	9
18	11
19	8
20	10
21	11
22	7
23	12
24	15
25	8
26	10
27	12
28	7
29	10
30	9
31	8
32	12
33	11
34	5
35	12
36	16
37	7
38	13
39	17
40	8
41	10
42	15
43	10
44	13
45	14
46	10
47	12
48	17
49	7
50	12
51	18
52	11
53	13
54	17
55	10
56	13
57	20
58	11
59	14
60	17
61	8
62	10
63	16
64	7
65	10