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.

A226135 Let abcd... be the decimal expansion of n. Number of iterations of the map n -> f(n) needed to reach a number < 10, where f(n) = a^b + c^d + ... which ends in an exponent or a base according as the number of digits is even or odd.

Table of values

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

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 5, 2, 21, 2, 1, 1, 1, 3, 2, 3, 6, 8, 19, 6, 1, 1, 2, 5, 21, 3, 4, 12, 17, 4, 1, 1, 3, 2, 3, 5, 4, 15, 4, 3, 1, 1, 7, 2, 4, 14, 16, 4, 16, 4, 1, 1, 5, 6, 3, 2, 5, 11, 13, 15, 1, 1, 5]