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.

A332414 Positive integers r such that A(1,r) = A(2,r - 1) = ... = A(r,1) = 0, where A denotes the function mapping every pair of positive integers (m,n) into 1 if m * 2^(n + 2) + 1 is a prime number dividing F(n + 2) - 2, where F(n) denotes the n-th Fermat number (i.e., F(n) = A000215(n)); and into 0 otherwise.

Table of values

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

List of values

[1, 3, 4, 5, 8, 11, 12, 16, 19, 20, 21, 22, 23, 26, 28, 29, 32, 33, 34, 35, 36, 37, 38, 39, 44, 46, 47, 51, 52, 53, 55, 56, 57, 58, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 72, 74, 75, 76, 78, 80, 82, 84, 85, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 99, 100, 101]