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.

A348177 a(n) is the number of pair of positive integers (x, y) with 1 <= x <= y such that sum s = x + y and product p = x * y satisfy s + p = 2^n, with n > 0.

Table of values

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

List of values

[0, 0, 1, 0, 1, 1, 1, 0, 3, 2, 1, 1, 1, 3, 5, 0, 1, 7, 1, 1, 5, 3, 1, 3, 7, 7, 9, 1, 3, 23, 1, 1, 11, 7, 15, 7, 3, 7, 5, 1, 3, 31, 1, 3, 31, 15, 3, 3, 3, 31, 23, 3, 3, 31, 23, 3, 11, 3, 7, 7, 1, 15, 31, 1, 31, 31, 3, 5, 11, 47, 3, 15, 3, 15, 47, 7, 31, 383, 1, 3]