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.

A341422 a(n) is the number of solutions of the congruence j^2 + j + 1 == 0 (mod k = A034017(n+1)), for j from {0, 1, 2, ..., k-1}, for n >= 1.

Table of values

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

List of values

[1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 4, 2, 2, 2, 2, 2, 2, 2, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 4, 2, 2, 2, 2, 2, 4, 4, 2, 4, 2, 2, 2, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 4, 4, 2, 2, 2, 4, 2, 2, 2, 2, 2, 4, 2, 4, 2, 2, 2, 2, 4, 2, 2, 2, 2, 4, 4, 2, 2, 2, 4, 2, 2]