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.

A332416 Positive integers r such that B(1,r) = B(2,r - 1) = ... = B(r,1) = 0, where B 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), 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 6
6 7
7 8
8 11
9 12
10 13
11 14
12 15
13 16
14 17
15 19
16 20
17 21
18 22
19 23
20 24
21 25
22 26
23 28
24 29
25 31
26 32
27 33
28 34
29 35
30 36
31 37
32 38
33 39
34 40
35 41
36 42
37 44
38 46
39 47
40 48
41 50
42 51
43 52
44 53
45 54
46 55
47 56
48 57
49 58
50 60
51 61
52 62
53 63
54 64
55 65
56 66
57 67
58 68
59 69
60 70
61 71
62 72
63 73
64 74
65 75
66 76
67 78
68 79

List of values

[1, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 15, 16, 17, 19, 20, 21, 22, 23, 24, 25, 26, 28, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 44, 46, 47, 48, 50, 51, 52, 53, 54, 55, 56, 57, 58, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 78, 79]