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.

A329245 For any n > 0, let m = 2*n - 1 (m is the n-th odd number); a(n) is the least k > 1 such that m AND (m^k) = m (where AND denotes the bitwise AND operator).

Table of values

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

List of values

[2, 3, 3, 3, 3, 5, 5, 3, 3, 7, 7, 5, 5, 9, 9, 3, 3, 3, 11, 3, 3, 5, 5, 5, 5, 15, 7, 9, 9, 17, 17, 3, 3, 3, 5, 5, 5, 5, 9, 3, 3, 23, 7, 13, 13, 9, 9, 5, 5, 19, 11, 3, 3, 5, 21, 9, 9, 15, 23, 17, 17, 33, 33, 3, 3, 3, 3, 3, 7, 5, 5, 3, 3, 7, 7, 21, 21, 17, 9, 3, 3]

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

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