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.

A117406 Integer k such that 2^n + k = A117405(n).

Table of values

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

List of values

[3, 2, 0, 1, -1, 1, 1, 1, -2, -1, 3, -1, 1, 1, -2, -3, -5, 1, -2, 1, 1, -3, 7, -1, 3, -3, 3, 3, 1, 6, -3, 1, 1, -3, -3, -3, -3, -1, 18, 3, 1, -1, 3, 1, -3, 3, 7, -9, 3, -1, 7, -5, 3, 11, -3, -5, 6, -9, -3, -1, -3, 1, -2, 9, 1, 5, 3, -1, -5, -13, 9, -3, -7, -3]