cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A304032 Number of ways to write 2*n as p + 2^k + 3^m with p prime and 2^k + 3^m a product of at most two distinct primes, where k and m are nonnegative integers.

Table of values

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

List of values

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