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.

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

Table of values

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

List of values

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