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.

A139281 If all digits are the same mod 3, stop; otherwise write down the number formed by the 1 mod 3 digits and the number formed by the 2 mod 3 digits and the number formed by the 3 mod 3 digits and multiply them; repeat.

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

List of values

[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 11, 2, 3, 14, 5, 6, 17, 8, 9, 0, 2, 22, 6, 8, 25, 2, 14, 28, 8, 30, 3, 6, 33, 2, 5, 36, 2, 8, 39, 0, 41, 8, 2, 44, 0, 8, 47, 6, 36, 0, 5, 52, 5, 0, 55, 30, 5, 58, 0, 60, 6, 2, 63, 8, 30, 66, 8, 6, 69, 0, 71, 14, 2, 74, 5, 8, 77, 30, 63, 0, 8, 82, 8, 6, 85, 6, 30]