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.

A066808 a(n) = F(n)-1 mod 2^n+1 with F(n) = n-th Fermat number = 1+2^2^n.

Table of values

n a(n)
0 0
1 1
2 1
3 4
4 1
5 4
6 16
7 4
8 1
9 256
10 16
11 4
12 4081
13 4
14 16
15 256
16 1
17 4
18 261121
19 4
20 65536
21 256
22 16
23 4
24 65536
25 33554305
26 16
27 67108864
28 65536
29 4
30 16
31 4
32 1
33 256
34 16
35 262144
36 68451041281
37 4
38 16
39 256
40 65536
41 4
42 4398042316801
43 4
44 65536
45 35184371957761
46 16
47 4
48 281474976645121

List of values

[0, 1, 1, 4, 1, 4, 16, 4, 1, 256, 16, 4, 4081, 4, 16, 256, 1, 4, 261121, 4, 65536, 256, 16, 4, 65536, 33554305, 16, 67108864, 65536, 4, 16, 4, 1, 256, 16, 262144, 68451041281, 4, 16, 256, 65536, 4, 4398042316801, 4, 65536, 35184371957761, 16, 4, 281474976645121]