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.

A340672 Number of repeated applications of the '4x+-1' operation needed to reach 1 from n, or -1 if 1 is never reached.

Table of values

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

List of values

[0, 3, 1, 8, 6, 4, 4, 11, 2, 36, 9, 9, 34, 16, 7, 7, 32, 5, 14, 5, 5, 39, 30, 12, 12, 12, 3, 46, 37, 37, 28, 19, 10, 10, 10, 10, 44, 35, 35, 26, 26, 17, 17, 17, 8, 8, 8, 8, 42, 33, 33, 33, 24, 6, 24, 15, 15, 15, 15, 6, 6, 49, 6, 40, 40, 40, 31, 31, 31, 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.