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.

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

Table of values

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

List of values

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