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.

A120385 If a(n-1) = 1 then largest value so far + 1, otherwise floor(a(n-1)/2); or table T(n,k) with T(n,0) = n, T(n,k+1) = floor(T(n,k)/2).

Table of values

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

List of values

[1, 2, 1, 3, 1, 4, 2, 1, 5, 2, 1, 6, 3, 1, 7, 3, 1, 8, 4, 2, 1, 9, 4, 2, 1, 10, 5, 2, 1, 11, 5, 2, 1, 12, 6, 3, 1, 13, 6, 3, 1, 14, 7, 3, 1, 15, 7, 3, 1, 16, 8, 4, 2, 1, 17, 8, 4, 2, 1, 18, 9, 4, 2, 1, 19, 9, 4, 2, 1, 20, 10, 5, 2, 1, 21, 10, 5, 2, 1, 22, 11, 5, 2, 1, 23, 11, 5, 2, 1, 24, 12, 6, 3, 1, 25]