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.

A227195 a(n) = one less than the first i >= 1 for which the Kronecker symbol K(i,n) is either 0 or -1. Or the maximal value u such that all K(1,n), K(2,n), ... up to K(u,n) have +1 as their values.

Table of values

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

List of values

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