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.

A280493 Sum of GF(2)[X] divisors of n: the sum is ordinary sum of integers, the summands being all the natural numbers whose binary expansions encode such (0,1)-polynomials that divide the (0,1)-polynomial encoded by n when the polynomial factorization is done over the field GF(2).

Table of values

n a(n)
1 1
2 3
3 4
4 7
5 9
6 12
7 8
8 15
9 20
10 27
11 12
12 28
13 14
14 24
15 24
16 31
17 41
18 60
19 20
20 63
21 29
22 36
23 40
24 60
25 26
26 42
27 52
28 56
29 44
30 72
31 32
32 63
33 68
34 123
35 56
36 140
37 38
38 60
39 88
40 135
41 42
42 87
43 72
44 84
45 112
46 120
47 48
48 124
49 68
50 78
51 92
52 98
53 76
54 156
55 56
56 120
57 102
58 132
59 60
60 168
61 62
62 96
63 104
64 127
65 201
66 204
67 68
68 287
69 81
70 168
71 136
72 300
73 74
74 114
75 192
76 140
77 140
78 264
79 112
80 279
81 95
82 126
83 192
84 203

List of values

[1, 3, 4, 7, 9, 12, 8, 15, 20, 27, 12, 28, 14, 24, 24, 31, 41, 60, 20, 63, 29, 36, 40, 60, 26, 42, 52, 56, 44, 72, 32, 63, 68, 123, 56, 140, 38, 60, 88, 135, 42, 87, 72, 84, 112, 120, 48, 124, 68, 78, 92, 98, 76, 156, 56, 120, 102, 132, 60, 168, 62, 96, 104, 127, 201, 204, 68, 287, 81, 168, 136, 300, 74, 114, 192, 140, 140, 264, 112, 279, 95, 126, 192, 203]