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.

A099794 a(n) = smallest integer k such that k*prime(n) == 1 mod j for each integer j with 1

Table of values

n a(n)
1 1
2 1
3 5
4 43
5 2291
6 6397
7 423953
8 2579419
9 30364247
10 77544004469
11 1277242663471
12 70250377083373
13 3909462041753561
14 101888460343995907
15 8217087542785091183
16 2455846588270412484317
17 38974424104246263663539

List of values

[1, 1, 5, 43, 2291, 6397, 423953, 2579419, 30364247, 77544004469, 1277242663471, 70250377083373, 3909462041753561, 101888460343995907, 8217087542785091183, 2455846588270412484317, 38974424104246263663539]