A304034 - cp's OEIS frontend

A304034 Number of ways to write n as p + 2^k + (1+(n mod 2))3^m with p prime, where k and m are positive integers with 2^k + (1+(n mod 2))3^m squarefree.

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

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

cp's OEIS Frontend

A304034 Number of ways to write n as p + 2^k + (1+(n mod 2))3^m with p prime, where k and m are positive integers with 2^k + (1+(n mod 2))3^m squarefree.

Table of values

List of values

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

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

cp's OEIS Frontend

A304034 Number of ways to write n as p + 2^k + (1+(n mod 2))*3^m with p prime, where k and m are positive integers with 2^k + (1+(n mod 2))*3^m squarefree.

Table of values

List of values

A304034 Number of ways to write n as p + 2^k + (1+(n mod 2))3^m with p prime, where k and m are positive integers with 2^k + (1+(n mod 2))3^m squarefree.

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