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.

A348598 Least prime p of the form k^2+1 such that p == A002496(n) (mod A002496(n+1)) with p>A002496(n), or 0 if no such p exists.

Table of values

n a(n)
1 17
2 1297
3 90001
4 1008017
5 147457
6 2421137
7 15952037
8 1378277
9 7203857
10 107122501
11 164968337
12 34503877
13 38688401
14 4851958337
15 1075577617
16 197121601
17 1044582401
18 315559697
19 70924211857
20 730296577
21 20705483237
22 15103426817
23 197740302401
24 4587352901
25 155964965777

List of values

[17, 1297, 90001, 1008017, 147457, 2421137, 15952037, 1378277, 7203857, 107122501, 164968337, 34503877, 38688401, 4851958337, 1075577617, 197121601, 1044582401, 315559697, 70924211857, 730296577, 20705483237, 15103426817, 197740302401, 4587352901, 155964965777]