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.

A324495 Average number of steps t(n) required to get n by repeatedly toggling one of the ceiling(log_2(n)) bits of the binary result of the previous step at a random position with equal probability of the bit positions, starting with all bits 0. The fractional part of t is given separately, i.e., t(n) = a(n) + A324496(n)/A324497(n).

Table of values

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

List of values

[1, 3, 4, 7, 9, 9, 10, 15, 18, 18, 20, 18, 20, 20, 21, 31, 37, 37, 40, 37, 40, 40, 41, 37, 40, 40, 41, 40, 41, 41, 42, 63, 74, 74, 78, 74, 78, 78, 80, 74, 78, 78, 80, 78, 80, 80, 82, 74, 78, 78, 80, 78, 80, 80, 82, 78, 80, 80, 82, 80, 82, 82, 83, 127, 147, 147, 153]

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

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