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.

A260713 Number of iterations of A234742 needed when starting from A236844(n) before a fixed point is reached.

Table of values

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

List of values

[6, 6, 5, 4, 6, 55, 141, 5, 4, 1, 6, 2, 145, 55, 6, 2, 141, 5, 2, 4, 4, 1, 4, 5, 6, 3, 4, 2, 4, 145, 55, 1, 3, 6, 3, 2, 14, 2, 141, 27, 5, 65, 1, 10, 2, 1, 4, 4, 4, 1, 4, 3, 1, 3, 9, 5, 1, 6, 5, 18, 3, 4, 2, 6, 4, 3, 145, 17, 55, 4, 1, 11, 36, 1, 3, 6, 5, 14, 3, 2, 14, 4, 1, 10, 2, 13, 141, 1, 6, 3, 27, 5, 9, 2, 65, 10, 1, 10, 2, 10, 2, 2, 3, 52, 86, 1]