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.

A293390 Least m such that the exponents in expression for n as a sum of distinct powers of 2 are pairwise distinct mod m; a(0) = 0 by convention.

Table of values

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

List of values

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