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.

A254411 Limit of f(f(f(...f(0)...))) modulo n as the number of iterations of f(x) = 2^x+1 grows.

Table of values

n a(n)
1 0
2 1
3 0
4 1
5 3
6 3
7 2
8 1
9 0
10 3
11 9
12 9
13 6
14 9
15 3
16 1
17 3
18 9
19 0
20 13
21 9
22 9
23 7
24 9
25 18
26 19
27 0
28 9
29 20
30 3
31 9
32 1
33 9
34 3
35 23
36 9
37 32
38 19
39 6
40 33
41 34
42 9
43 40
44 9
45 18
46 7
47 35
48 33
49 23
50 43
51 3
52 45
53 42
54 27
55 53
56 9
57 0
58 49
59 32
60 33
61 54
62 9
63 9
64 1
65 58
66 9
67 44
68 37
69 30
70 23
71 30
72 9
73 2
74 69
75 18
76 57
77 9
78 45
79 65
80 33
81 0
82 75
83 25
84 9
85 3
86 83
87 78
88 9
89 68
90 63
91 58
92 53
93 9
94 35
95 38
96 33
97 71
98 23
99 9
100 93

List of values

[0, 1, 0, 1, 3, 3, 2, 1, 0, 3, 9, 9, 6, 9, 3, 1, 3, 9, 0, 13, 9, 9, 7, 9, 18, 19, 0, 9, 20, 3, 9, 1, 9, 3, 23, 9, 32, 19, 6, 33, 34, 9, 40, 9, 18, 7, 35, 33, 23, 43, 3, 45, 42, 27, 53, 9, 0, 49, 32, 33, 54, 9, 9, 1, 58, 9, 44, 37, 30, 23, 30, 9, 2, 69, 18, 57, 9, 45, 65, 33, 0, 75, 25, 9, 3, 83, 78, 9, 68, 63, 58, 53, 9, 35, 38, 33, 71, 23, 9, 93]