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.

A321577 a(n) = F_n mod M_n, where F_n = 2^(2^n) + 1 and M_n = 2^n - 1.

Table of values

n a(n)
1 0
2 2
3 5
4 2
5 5
6 17
7 5
8 2
9 257
10 17
11 5
12 17
13 5
14 17
15 257
16 2
17 5
18 1025
19 5
20 65537
21 257
22 17
23 5
24 65537
25 129
26 17
27 67108865
28 65537
29 5
30 17
31 5
32 2
33 257
34 17
35 262145
36 268435457
37 5
38 17
39 257
40 65537
41 5
42 4194305
43 5
44 65537
45 131073
46 17
47 5
48 65537
49 1073741825
50 16777217
51 257
52 65537
53 5

List of values

[0, 2, 5, 2, 5, 17, 5, 2, 257, 17, 5, 17, 5, 17, 257, 2, 5, 1025, 5, 65537, 257, 17, 5, 65537, 129, 17, 67108865, 65537, 5, 17, 5, 2, 257, 17, 262145, 268435457, 5, 17, 257, 65537, 5, 4194305, 5, 65537, 131073, 17, 5, 65537, 1073741825, 16777217, 257, 65537, 5]