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.

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

Table of values

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

List of values

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