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.

A323375 Let f(p, q) denote the pair (p + q, wt(p) + wt(q)). a(n) gives the number of iterations of f starting at (n, 1) needed to make p/q an integer, or if no integer is ever reached then a(n) = -1. (Here wt is binary weight, A000120.)

Table of values

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

List of values

[1, 3, 3, 3, 1, 2, 1, 11, 4, 10, 1, 3, 4, 9, 2, 19, 1, 18, 1, 1, 7, 17, 7, 7, 6, 5, 6, 6, 1, 4, 15, 5, 16, 4, 1, 2, 4, 3, 1, 14, 3, 13, 13, 13, 12, 12, 1, 6, 12, 2, 5, 5, 11, 1, 5, 13, 10, 4, 1, 12, 3, 9, 3, 3, 1, 2, 1, 1, 40, 2, 8, 8, 39, 3, 7, 7, 9, 2, 3, 1, 3, 37, 37, 37, 5, 36, 36, 3, 1, 8]