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.

A378559 a(n) = t is the smallest prime t > p = prime(n) for which t == p (mod k) for all k = 2,...,p-1.

Table of values

n a(n)
1 3
2 5
3 17
4 67
5 2531
6 27733
7 2162177
8 12252259
9 465585143
10 240940299629
11 6987268688431
12 577614211574437
13 48086383113568841
14 438120379479182443
15 75356705270419372847
16 27891400538213970357653
17 5584478196651286064932859
18 38762848659108926803651261
19 23645337682056445350227232067

List of values

[3, 5, 17, 67, 2531, 27733, 2162177, 12252259, 465585143, 240940299629, 6987268688431, 577614211574437, 48086383113568841, 438120379479182443, 75356705270419372847, 27891400538213970357653, 5584478196651286064932859, 38762848659108926803651261, 23645337682056445350227232067]