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.

A306612 a(n) is the least integer k > 2 such that the remainder of -k modulo p is strictly increasing over the first n primes.

Table of values

n a(n)
1 3
2 4
3 7
4 8
5 16
6 16
7 157
8 157
9 16957
10 19231
11 80942
12 82372
13 82372
14 9624266
15 19607227
16 118867612
17 4968215191
18 31090893772
19 118903377091
20 187341482252
21 1784664085208
22 12330789708022
23 68016245854132
24 68016245854132
25 10065964847743822
26 74887595879692807
27 1825207861455319267
28 98403562254816509476
29 283462437415903129597
30 2126598918934702375802

List of values

[3, 4, 7, 8, 16, 16, 157, 157, 16957, 19231, 80942, 82372, 82372, 9624266, 19607227, 118867612, 4968215191, 31090893772, 118903377091, 187341482252, 1784664085208, 12330789708022, 68016245854132, 68016245854132, 10065964847743822, 74887595879692807, 1825207861455319267, 98403562254816509476, 283462437415903129597, 2126598918934702375802]

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

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