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.

A260590 The modified Syracuse algorithm, msa, applied to 2n+1.

Table of values

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

List of values

[4, 2, 7, 2, 5, 2, 7, 2, 4, 2, 5, 2, 59, 2, 56, 2, 4, 2, 8, 2, 5, 2, 54, 2, 4, 2, 5, 2, 7, 2, 54, 2, 4, 2, 51, 2, 5, 2, 8, 2, 4, 2, 5, 2, 45, 2, 8, 2, 4, 2, 42, 2, 5, 2, 31, 2, 4, 2, 5, 2, 8, 2, 15, 2, 4, 2, 7, 2, 5, 2, 7, 2, 4, 2, 5, 2, 40, 2, 21, 2, 4, 2, 29, 2, 5, 2, 8, 2, 4, 2, 5, 2, 7, 2, 13]