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.

A347297 a(1) = 1; for n >= 1, if a(n) is even then a(n+1) = a(n) / 2, otherwise, say a(n) is the k-th odd term in the sequence, a(n+1) = a(n) + k.

Table of values

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

List of values

[1, 2, 1, 3, 6, 3, 7, 12, 6, 3, 9, 16, 8, 4, 2, 1, 9, 18, 9, 19, 30, 15, 27, 40, 20, 10, 5, 19, 34, 17, 33, 50, 25, 43, 62, 31, 51, 72, 36, 18, 9, 31, 54, 27, 51, 76, 38, 19, 45, 72, 36, 18, 9, 37, 66, 33, 63, 94, 47, 79, 112, 56, 28, 14, 7, 41, 76, 38, 19, 55]