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.

A338920 a(n) is the number of times it takes to iteratively subtract m from n where m is the largest nonzero proper suffix of n less than or equal to the remainder until no further subtraction is possible.

Table of values

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

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 11, 6, 4, 3, 3, 2, 2, 2, 2, 0, 21, 11, 7, 6, 5, 4, 3, 3, 3, 0, 31, 16, 11, 8, 7, 6, 5, 4, 4, 0, 41, 21, 14, 11, 9, 7, 6, 6, 5, 0, 51, 26, 17, 13, 11, 9, 8, 7, 6, 0, 61, 31, 21, 16, 13, 11, 9, 8, 7, 0, 71, 36, 24, 18, 15, 12, 11, 9]