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.

A260716 a(n) = number of iterations of A234742 needed when starting from A091209(n) before a fixed point is reached.

Table of values

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

List of values

[6, 4, 55, 141, 2, 2, 4, 5, 3, 4, 3, 14, 2, 1, 4, 3, 1, 18, 6, 3, 17, 36, 1, 10, 13, 1, 10, 2, 2, 86, 27, 7, 4, 50, 1, 4, 6, 4, 3, 13, 7, 3, 1, 207, 2, 7, 10, 10, 128, 7, 2, 4, 2, 9, 20, 2, 15, 24, 3, 10, 64, 7, 4, 4, 1, 4, 15, 8, 4, 1, 45, 3, 2, 1, 1, 2, 6, 28, 1, 2, 11, 1, 3, 14, 13, 3, 11, 12, 4, 28, 3, 7, 55, 40, 9, 4, 51, 5, 2, 6, 1, 2, 1, 15, 1]