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.

A261231 a(n) = number of steps to reach 0 when starting from k = n and repeatedly applying the map that replaces k with k - (sum of digits in base-3 representation of k).

Table of values

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

List of values

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