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.

A096306 Number of iterations of n -> n + (largest digit of n) needed for the trajectory of n to join the trajectory of A045844.

Table of values

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

List of values

[0, 0, 18, 0, 19, 17, 16, 0, 15, 18, 17, 16, 1, 15, 2, 0, 1, 14, 1, 1, 15, 0, 14, 0, 3, 13, 3, 0, 2, 2, 3, 12, 1, 2, 11, 0, 10, 1, 9, 10, 69, 0, 9, 9, 68, 0, 8, 8, 66, 67, 8, 0, 66, 7, 66, 7, 0, 65, 6, 65, 62, 6, 63, 0, 63, 64, 61, 5, 62, 0, 62, 63, 63, 60, 4, 4, 0, 61, 62, 62, 59, 3, 3, 0, 2, 60]