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.

A281680 a(0)=1; for n > 0, if 2n+1 is prime, then a(n)=1, otherwise a(n) = (2n+1)/(largest proper divisor of 2n+1).

Table of values

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

List of values

[1, 1, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 5, 3, 1, 1, 3, 5, 1, 3, 1, 1, 3, 1, 7, 3, 1, 5, 3, 1, 1, 3, 5, 1, 3, 1, 1, 3, 7, 1, 3, 1, 5, 3, 1, 7, 3, 5, 1, 3, 1, 1, 3, 1, 1, 3, 1, 5, 3, 7, 11, 3, 5, 1, 3, 1, 7, 3, 1, 1, 3, 11, 5, 3, 1, 1, 3, 5, 1, 3, 7, 1, 3, 1, 13, 3, 1]