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.

A220863 Choose smallest m>0 such that the n-th rational prime p splits in the imaginary quadratic extension field K = Q(sqrt(-m)); a(n) = discriminant(K).

Table of values

n a(n)
1 -7
2 -8
3 -4
4 -3
5 -8
6 -4
7 -4
8 -8
9 -20
10 -4
11 -3
12 -4
13 -4
14 -8
15 -20
16 -4
17 -8
18 -4
19 -8
20 -7
21 -4
22 -3
23 -8
24 -4
25 -4
26 -4
27 -3
28 -8
29 -4
30 -4
31 -3
32 -8
33 -4
34 -8
35 -4
36 -3
37 -4
38 -8
39 -20
40 -4
41 -8
42 -4
43 -7
44 -4
45 -4
46 -3
47 -8
48 -3
49 -8
50 -4
51 -4
52 -7
53 -4
54 -8
55 -4
56 -20
57 -4
58 -3
59 -4
60 -4
61 -8
62 -4
63 -8
64 -11
65 -4
66 -4
67 -8
68 -4
69 -8
70 -4
71 -4
72 -7
73 -3
74 -4
75 -8

List of values

[-7, -8, -4, -3, -8, -4, -4, -8, -20, -4, -3, -4, -4, -8, -20, -4, -8, -4, -8, -7, -4, -3, -8, -4, -4, -4, -3, -8, -4, -4, -3, -8, -4, -8, -4, -3, -4, -8, -20, -4, -8, -4, -7, -4, -4, -3, -8, -3, -8, -4, -4, -7, -4, -8, -4, -20, -4, -3, -4, -4, -8, -4, -8, -11, -4, -4, -8, -4, -8, -4, -4, -7, -3, -4, -8]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.