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.

A287877 Start with n and repeatedly apply the powertrain map x -> A133500(x); a(n) is the fixed point that is eventually reached, or -1 if the trajectory never reaches a fixed point.

Table of values

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

List of values

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