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.

A324601 Unique solution x of the congruence x^2 = -1 (mod m(n)), with m(n) = A002559(n) (Markoff numbers) in the interval [1, floor(m(n)/2)], assuming the Markoff uniqueness conjecture, for n >= 3.

Table of values

n a(n)
3 2
4 5
5 12
6 13
7 34
8 70
9 75
10 89
11 179
12 133
13 183
14 182
15 610
16 1120
17 919
18 2378
19 1719
20 2923
21 2216
22 4181
23 5479
24 10946
25 13860
26 2337
27 16725
28 19760
29 13563
30 13357
31 39916
32 822
33 26982
34 15075
35 3952
36 162867
37 117922
38 196418
39 249755
40 201757
41 259304
42 86545
43 464656
44 562781
45 651838
46 770133
47 553093
48 1116300
49 1354498
50 1346269
51 56794
52 58355
53 3087111
54 2435532
55 166408
56 3729600
57 4440035
58 923756

List of values

[2, 5, 12, 13, 34, 70, 75, 89, 179, 133, 183, 182, 610, 1120, 919, 2378, 1719, 2923, 2216, 4181, 5479, 10946, 13860, 2337, 16725, 19760, 13563, 13357, 39916, 822, 26982, 15075, 3952, 162867, 117922, 196418, 249755, 201757, 259304, 86545, 464656, 562781, 651838, 770133, 553093, 1116300, 1354498, 1346269, 56794, 58355, 3087111, 2435532, 166408, 3729600, 4440035, 923756]