A303660 - cp's OEIS frontend

A303660 Number of ways to write 2*n+1 as p + 3^k + 5^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	3
6	4
7	4
8	4
9	4
10	5
11	3
12	4
13	4
14	3
15	6
16	7
17	5
18	6
19	8
20	5
21	5
22	9
23	6
24	5
25	8
26	3
27	6
28	8
29	4
30	4
31	7
32	6
33	4
34	8
35	6
36	5
37	9
38	4
39	4
40	8
41	3
42	6
43	8
44	7
45	4
46	9
47	6
48	4
49	9
50	5
51	5
52	9
53	6
54	6
55	11
56	7
57	7
58	9
59	5
60	3
61	8
62	5
63	3
64	9
65	7
66	7
67	11
68	8
69	8
70	12

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

cp's OEIS Frontend

A303660 Number of ways to write 2*n+1 as p + 3^k + 5^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	3
6	4
7	4
8	4
9	4
10	5
11	3
12	4
13	4
14	3
15	6
16	7
17	5
18	6
19	8
20	5
21	5
22	9
23	6
24	5
25	8
26	3
27	6
28	8
29	4
30	4
31	7
32	6
33	4
34	8
35	6
36	5
37	9
38	4
39	4
40	8
41	3
42	6
43	8
44	7
45	4
46	9
47	6
48	4
49	9
50	5
51	5
52	9
53	6
54	6
55	11
56	7
57	7
58	9
59	5
60	3
61	8
62	5
63	3
64	9
65	7
66	7
67	11
68	8
69	8
70	12

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

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