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.

A094049 Let p(n) be the n-th prime congruent to 1 mod 4. Then a(n) = the least k for which m^2+1=p(n)*k^2 has a solution.

Table of values

n a(n)
1 1
2 5
3 1
4 13
5 1
6 5
7 25
8 3805
9 125
10 53
11 569
12 1
13 851525
14 73
15 149
16 9305
17 385645
18 85
19 82596761
20 126985
21 1
22 113
23 1517
24 4574225
25 1
26 5
27 535979945
28 63445
29 145
30 7170685
31 19805
32 55335641
33 493
34 3793
35 265
36 65
37 1027776565
38 1

List of values

[1, 5, 1, 13, 1, 5, 25, 3805, 125, 53, 569, 1, 851525, 73, 149, 9305, 385645, 85, 82596761, 126985, 1, 113, 1517, 4574225, 1, 5, 535979945, 63445, 145, 7170685, 19805, 55335641, 493, 3793, 265, 65, 1027776565, 1]

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

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