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.

A358647 Final digit reached by traveling right (with wraparound) through the digits of n. Each move steps right k places, where k is the digit at the beginning of the move. Moves begin at the most significant digit and d moves are made, where d is the number of digits in n.

Table of values

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

List of values

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