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.

A277547 a(n) = n/9^m mod 9, where 9^m is the greatest power of 9 that divides n.

Table of values

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

List of values

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