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.

A288311 Number of steps, reduced mod n, to reach 1 in the Collatz 3x+1 problem, or -1 if 1 is never reached.

Table of values

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

List of values

[0, 1, 1, 2, 0, 2, 2, 3, 1, 6, 3, 9, 9, 3, 2, 4, 12, 2, 1, 7, 7, 15, 15, 10, 23, 10, 3, 18, 18, 18, 13, 5, 26, 13, 13, 21, 21, 21, 34, 8, 27, 8, 29, 16, 16, 16, 10, 11, 24, 24, 24, 11, 11, 4, 2, 19, 32, 19, 32, 19, 19, 45, 44, 6, 27, 27, 27, 14, 14, 14, 31, 22]

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

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