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.

A102421 To get a(n), start with 2n+1, multiply by 3 and add 1 and divide out any power of 2; then multiply by 3 and subtract 1 and divide out any power of 2.

Table of values

n a(n)
0 1
1 7
2 1
3 1
4 5
5 25
6 7
7 17
8 19
9 43
10 1
11 13
12 7
13 61
14 1
15 35
16 37
17 79
18 5
19 11
20 23
21 97
22 25
23 53
24 55
25 115
26 7
27 31
28 1
29 133
30 17
31 71
32 73
33 151
34 19
35 5
36 41
37 169
38 43
39 89
40 91
41 187
42 1
43 49
44 25
45 205
46 13
47 107
48 109
49 223
50 7
51 29
52 59
53 241
54 61
55 125
56 127
57 259
58 1
59 67
60 17
61 277
62 35
63 143
64 145
65 295
66 37
67 19
68 77
69 313

List of values

[1, 7, 1, 1, 5, 25, 7, 17, 19, 43, 1, 13, 7, 61, 1, 35, 37, 79, 5, 11, 23, 97, 25, 53, 55, 115, 7, 31, 1, 133, 17, 71, 73, 151, 19, 5, 41, 169, 43, 89, 91, 187, 1, 49, 25, 205, 13, 107, 109, 223, 7, 29, 59, 241, 61, 125, 127, 259, 1, 67, 17, 277, 35, 143, 145, 295, 37, 19, 77, 313]