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.

A318508 a(n) = A032742(n) AND A001065(n)-A032742(n), where AND is bitwise-and (A004198) and A001065 = sum of proper divisors and A032742 = the largest proper divisor of n.

Table of values

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

List of values

[0, 0, 0, 0, 0, 3, 0, 0, 1, 1, 0, 2, 0, 3, 4, 0, 0, 8, 0, 8, 4, 3, 0, 8, 1, 1, 0, 14, 0, 11, 0, 0, 0, 1, 6, 0, 0, 3, 4, 20, 0, 1, 0, 18, 2, 3, 0, 16, 1, 16, 0, 16, 0, 3, 2, 4, 0, 1, 0, 14, 0, 3, 20, 0, 4, 33, 0, 0, 4, 35, 0, 4, 0, 1, 24, 2, 8, 35, 0, 0, 9, 1, 0, 34, 0, 3, 4, 32, 0, 33, 8, 14, 4, 3, 2, 32, 0, 16, 0, 2, 0, 51, 0, 52, 32]