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.

A080799 Number of divide by 2 and add 1 operations required to reach ...,7,8,4,2,1 when started at n.

Table of values

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

List of values

[6, 5, 8, 7, 7, 6, 10, 9, 9, 8, 9, 8, 8, 7, 12, 11, 11, 10, 11, 10, 10, 9, 11, 10, 10, 9, 10, 9, 9, 8, 14, 13, 13, 12, 13, 12, 12, 11, 13, 12, 12, 11, 12, 11, 11, 10, 13, 12, 12, 11, 12, 11, 11, 10, 12, 11, 11, 10, 11, 10, 10, 9, 16, 15, 15, 14, 15, 14, 14, 13, 15, 14, 14, 13, 14, 13, 13]

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

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