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.

A352582 Two-column array read by rows, where the n-th row is the least pair of integers (p, q) such that f(p) = f(n) + q*f(n+1) where f(n) = A002496(n) is the n-th prime of the form k^2+1.

Table of values

n a(n)
1 3
2 3
3 11
4 76
5 49
6 2432
7 113
8 9980
9 55
10 748
11 166
12 9420
13 384
14 39780
15 130
16 2388
17 271
18 10640
19 867
20 82592
21 1054
22 103040
23 548
24 11828
25 578
26 12332
27 4874
28 1113600
29 2461
30 196380
31 1137
32 27932
33 2426
34 128944
35 1393
36 35708
37 16086
38 5861020
39 2052
40 54268
41 9154
42 1437780
43 7981
44 982208

List of values

[3, 3, 11, 76, 49, 2432, 113, 9980, 55, 748, 166, 9420, 384, 39780, 130, 2388, 271, 10640, 867, 82592, 1054, 103040, 548, 11828, 578, 12332, 4874, 1113600, 2461, 196380, 1137, 27932, 2426, 128944, 1393, 35708, 16086, 5861020, 2052, 54268, 9154, 1437780, 7981, 982208]