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.

A347296 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) + a(k).

Table of values

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

List of values

[1, 2, 1, 3, 4, 2, 1, 4, 2, 1, 5, 7, 8, 4, 2, 1, 5, 7, 8, 4, 2, 1, 6, 3, 10, 5, 13, 17, 19, 20, 10, 5, 10, 5, 12, 6, 3, 11, 15, 17, 18, 9, 15, 18, 9, 19, 24, 12, 6, 3, 16, 8, 4, 2, 1, 18, 9, 28, 14, 7, 27, 37, 42, 21, 31, 36, 18, 9, 21, 27, 30, 15, 26, 13, 28]