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.

A094998 a(n) is smallest positive integer multiple of n-th prime, say k*prime(n), such that k*prime(n) == 1 (mod j) for each integer j with 1 < j < prime(n).

Table of values

n a(n)
1 2
2 3
3 25
4 301
5 25201
6 83161
7 7207201
8 49008961
9 698377681
10 2248776129601
11 39594522567601
12 2599263952084801
13 160287943711896001
14 4381203794791824001
15 386203114510899285601
16 130159869178331861668801

List of values

[2, 3, 25, 301, 25201, 83161, 7207201, 49008961, 698377681, 2248776129601, 39594522567601, 2599263952084801, 160287943711896001, 4381203794791824001, 386203114510899285601, 130159869178331861668801]