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.

A356365 For any nonnegative integer n with binary expansion Sum_{k = 1..w} 2^e_k, let m be the least integer such that the values e_k mod m are all distinct; a(n) = Sum_{k = 1..w} 2^(e_k mod m).

Table of values

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

List of values

[0, 1, 1, 3, 1, 5, 3, 7, 1, 3, 3, 11, 3, 13, 7, 15, 1, 3, 3, 19, 6, 7, 7, 23, 3, 25, 11, 27, 7, 29, 15, 31, 1, 3, 6, 7, 3, 7, 7, 39, 5, 11, 7, 43, 14, 15, 15, 47, 3, 7, 19, 51, 7, 53, 23, 55, 7, 57, 27, 59, 15, 61, 31, 63, 1, 5, 3, 7, 5, 7, 7, 71, 3, 13, 14, 15]