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.

A368315 a(n) gives the number of ways to go from n to 1 with steps consisting of replacing a positive number without leading zero, say m, appearing in the binary expansion of a number, by a proper divisor of m.

Table of values

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

List of values

[1, 1, 1, 2, 2, 3, 2, 4, 4, 7, 6, 8, 6, 8, 6, 8, 8, 17, 14, 21, 18, 28, 18, 20, 16, 27, 26, 26, 18, 31, 22, 16, 22, 37, 34, 58, 48, 76, 52, 58, 48, 98, 80, 102, 80, 105, 76, 48, 40, 85, 80, 96, 80, 153, 104, 76, 70, 99, 98, 119, 82, 136, 116, 32, 44, 123, 98]