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.

A079673 Consider pairs (r,s) such that the polynomial (x^r+1) divides (x^s+1) and 1 <= r < s. This sequence gives the r values; A079581 gives the s values.

Table of values

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

List of values

[1, 1, 2, 1, 1, 3, 2, 1, 4, 1, 2, 1, 3, 5, 1, 2, 6, 1, 4, 1, 3, 7, 2, 1, 8, 1, 5, 2, 1, 3, 9, 4, 1, 2, 6, 10, 1, 1, 3, 11, 2, 1, 5, 7, 4, 12, 1, 2, 1, 3, 13, 8, 1, 2, 6, 14, 1, 4, 1, 3, 5, 9, 15, 2, 1, 16, 1, 7, 2, 10, 1, 3, 17, 4, 1, 2, 6, 18, 1, 5, 11, 8, 1, 3, 19, 2, 1, 4, 12, 20, 1, 2, 1, 3, 7, 9, 21, 1]