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.

A075306 Smallest number == 0 mod (n+1)-th prime and == 1 mod all smaller primes.

Table of values

n a(n)
1 3
2 25
3 91
4 2101
5 23101
6 60061
7 510511
8 29099071
9 3792578791
10 84106011991
11 2005604901301
12 252305096583541
13 11561510014033981
14 52331045326680121
15 31359378912013061911
16 1792403716245452460151
17 98060777857864844592571

List of values

[3, 25, 91, 2101, 23101, 60061, 510511, 29099071, 3792578791, 84106011991, 2005604901301, 252305096583541, 11561510014033981, 52331045326680121, 31359378912013061911, 1792403716245452460151, 98060777857864844592571]