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.

A360469 Only k >= 0 such that, for every odd r > 0, A093179(n) divides the generalized Fermat number (A007117(n)^r)^(2^k) + 1.

Table of values

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

List of values

[3, 3, 5, 3, 7, 7, 9, 8, 11, 11, 13, 10, 15, 15, 17, 16, 19, 19, 21, 19, 23, 23, 25, 24, 27, 27, 29, 25, 31, 31, 33, 32, 35, 35, 37, 35, 39, 39, 41, 40, 43, 43, 45, 42, 47, 47, 49, 48, 51, 51, 53, 51, 55, 55, 57, 56, 59, 59, 61, 56, 63, 63, 65, 64, 67, 67, 69, 67, 71, 71, 73, 72, 75, 75, 77, 74, 79]