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.

A303932 Number of ways to write 2*n as p + 2^k + 3^m, where p is a prime with 11 a quadratic residue modulo p, and k and m are nonnegative integers.

Table of values

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

List of values

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