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.

A085068 Number of steps >= 1 for iteration of map x -> (4/3)*ceiling(x) to reach an integer when started at n, or -1 if no such integer is ever reached.

Table of values

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

List of values

[1, 3, 2, 1, 2, 9, 1, 8, 3, 1, 7, 2, 1, 2, 6, 1, 3, 4, 1, 5, 2, 1, 2, 3, 1, 6, 4, 1, 3, 2, 1, 2, 4, 1, 5, 3, 1, 4, 2, 1, 2, 4, 1, 3, 8, 1, 4, 2, 1, 2, 3, 1, 4, 7, 1, 3, 2, 1, 2, 7, 1, 4, 3, 1, 9, 2, 1, 2, 6, 1, 3, 6, 1, 5, 2, 1, 2, 3, 1, 6, 5, 1, 3, 2, 1, 2, 8, 1, 5, 3, 1, 5, 2, 1, 2, 5, 1, 3, 4, 1, 6]