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.

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

Table of values

n a(n)
1 2
2 18
3 4
4 70
5 6
6 32
7 182
8 29718
9 1068
10 500
11 5604
12 10
13 8890182
14 776
15 1744
16 113582
17 4832118
18 1118
19 1111225770
20 1764132
21 14
22 1710
23 23156
24 71011068
25 16
26 82
27 8920484118
28 1063532
29 2482
30 126862368
31 352618

List of values

[2, 18, 4, 70, 6, 32, 182, 29718, 1068, 500, 5604, 10, 8890182, 776, 1744, 113582, 4832118, 1118, 1111225770, 1764132, 14, 1710, 23156, 71011068, 16, 82, 8920484118, 1063532, 2482, 126862368, 352618]

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

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