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.

A332013 T(n, k) is the least positive m such that floor(n/m) AND floor(k/m) = 0 (where AND denotes the bitwise AND operator). Square array T(n, k) read by antidiagonals, n >= 0 and k >= 0.

Table of values

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

List of values

[1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 3, 2, 1, 1, 1, 3, 3, 1, 1, 1, 2, 1, 4, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 2, 5, 2, 3, 2, 1, 1, 1, 3, 3, 5, 5, 3, 3, 1, 1, 1, 2, 1, 3, 3, 6, 3, 3, 1, 2, 1, 1, 1, 1, 1, 3, 3, 3, 3, 1, 1, 1, 1, 1, 2, 3, 2, 1, 3, 7, 3, 1]