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.

A383135 a(n) = number of iterations that n requires to reach 1 under the x -> A380891(x) map, or -1 if it never does.

Table of values

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

List of values

[0, 1, 2, 1, 3, 1, 5, 2, 3, 2, 3, 2, 4, 2, 4, 2, 6, 2, 4, 2, 6, 2, 13, 2, 13, 2, 8, 3, 8, 3, 10, 3, 10, 3, 3, 3, 10, 3, 5, 3, 10, 3, 5, 3, 5, 3, 6, 3, 5, 3, 5, 3, 17, 3, 5, 3, 5, 3, 17, 3, 3, 3, 3, 2, 12, 2, 3, 2, 5, 2, 5, 2, 12, 2, 3, 2, 7, 2, 3, 2, 7, 2, 7, 2]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.