A295368 - cp's OEIS frontend

A295368 For any number n > 0 with s divisors, say d_1, d_2, ..., d_s such that d_1 = 1 < d_2 < ... < d_s = n, the binary representation of a(n) is (d_1 mod 2, d_2 mod 2, ..., d_s mod 2).

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

[1, 2, 3, 4, 3, 10, 3, 8, 7, 10, 3, 40, 3, 10, 15, 16, 3, 42, 3, 36, 15, 10, 3, 160, 7, 10, 15, 36, 3, 178, 3, 32, 15, 10, 15, 328, 3, 10, 15, 144, 3, 170, 3, 36, 63, 10, 3, 640, 7, 42, 15, 36, 3, 170, 15, 144, 15, 10, 3, 2696, 3, 10, 63, 64, 15, 170, 3, 36, 15]

cp's OEIS Frontend

A295368 For any number n > 0 with s divisors, say d_1, d_2, ..., d_s such that d_1 = 1 < d_2 < ... < d_s = n, the binary representation of a(n) is (d_1 mod 2, d_2 mod 2, ..., d_s mod 2).

Table of values

List of values