A304081 - cp's OEIS frontend

A304081 Number of ways to write n as p + 2^k + (1+(n mod 2))5^m, where p is an odd prime, and k and m are nonnegative integers with 2^k + (1+(n mod 2))5^m squarefree.

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

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

cp's OEIS Frontend

A304081 Number of ways to write n as p + 2^k + (1+(n mod 2))5^m, where p is an odd prime, and k and m are nonnegative integers with 2^k + (1+(n mod 2))5^m squarefree.

Table of values

List of values

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

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

cp's OEIS Frontend

A304081 Number of ways to write n as p + 2^k + (1+(n mod 2))*5^m, where p is an odd prime, and k and m are nonnegative integers with 2^k + (1+(n mod 2))*5^m squarefree.

Table of values

List of values

A304081 Number of ways to write n as p + 2^k + (1+(n mod 2))5^m, where p is an odd prime, and k and m are nonnegative integers with 2^k + (1+(n mod 2))5^m squarefree.

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