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.

A068640 Define f(n) = 2n+1, a(n) = largest prime of the form f(f(f(...(n))). If no such prime exists then a(n) = 0.

Table of values

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

List of values

[7, 47, 7, 0, 47, 13, 0, 17, 19, 0, 47, 0, 0, 59, 31, 0, 0, 37, 0, 167, 43, 0, 47, 0, 0, 107, 0, 0, 59, 61, 0, 0, 67, 0, 71, 73, 0, 0, 79, 0, 167, 0, 0, 2879, 0, 0, 0, 97, 0, 101, 103, 0, 107, 109, 0, 227, 0, 0, 0, 0, 0, 0, 127, 0, 263, 0, 0, 137, 139, 0, 0, 0, 0, 149, 151, 0, 0, 157, 0]