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.

A253719 Least k>0 such that n AND (n^k) <= 1, where AND denotes the bitwise AND operator.

Table of values

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

List of values

[1, 1, 2, 2, 2, 2, 3, 2, 2, 2, 2, 4, 2, 4, 4, 2, 2, 2, 2, 2, 3, 6, 5, 4, 2, 4, 2, 8, 3, 8, 5, 2, 2, 2, 2, 2, 2, 2, 3, 6, 2, 2, 4, 12, 2, 4, 4, 4, 2, 4, 2, 10, 3, 14, 6, 8, 2, 8, 6, 16, 3, 16, 6, 2, 2, 2, 2, 2, 2, 2, 4, 2, 3, 4, 4, 4, 2, 4, 4, 6, 2, 2, 5, 8, 4]

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

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