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.

A155860 Number of ways to write 2n-1 as p + 2^x + 3*2^y with p an odd prime and x,y positive integers.

Table of values

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

List of values

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