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.

A214073 Least m>0 such that 2^n-m and n^2-m are relatively prime.

Table of values

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

List of values

[1, 3, 1, 15, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 2, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 2, 5, 1, 5, 1, 3, 1, 3, 1, 3, 1, 5, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 1, 1, 3, 3, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 2, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 2]