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.

A082494 a(n) = n - (2^n (mod n)).

Table of values

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

List of values

[1, 2, 1, 4, 3, 2, 5, 8, 1, 6, 9, 8, 11, 10, 7, 16, 15, 8, 17, 4, 13, 18, 21, 8, 18, 22, 1, 12, 27, 26, 29, 32, 25, 30, 17, 8, 35, 34, 31, 24, 39, 20, 41, 28, 28, 42, 45, 32, 19, 26, 43, 36, 51, 26, 12, 24, 49, 54, 57, 44, 59, 58, 55, 64, 33, 2, 65, 52, 61, 26, 69, 8, 71, 70, 7, 60, 59]