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.

A015948 a(n) = smallest k >= n such that k | (2^k + n).

Table of values

n a(n)
0 1
1 2
2 5
3 4
4 7
5 10
6 15
7 8
8 11
9 14
10 13
11 28
12 21
13 78
14 17
15 16
16 19
17 22
18 49
19 42
20 23
21 26
22 1577
23 40
24 33
25 30
26 29
27 44
28 31
29 34
30 39
31 32
32 65
33 38
34 37
35 52
36 115
37 102
38 41
39 242
40 43
41 46
42 51
43 60
44 47
45 279
46 395
47 152
48 57
49 114
50 53
51 68
52 85
53 58
54 63
55 104
56 59
57 62
58 61
59 76
60 69
61 126
62 5773
63 64
64 67
65 1090

List of values

[1, 2, 5, 4, 7, 10, 15, 8, 11, 14, 13, 28, 21, 78, 17, 16, 19, 22, 49, 42, 23, 26, 1577, 40, 33, 30, 29, 44, 31, 34, 39, 32, 65, 38, 37, 52, 115, 102, 41, 242, 43, 46, 51, 60, 47, 279, 395, 152, 57, 114, 53, 68, 85, 58, 63, 104, 59, 62, 61, 76, 69, 126, 5773, 64, 67, 1090]