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.

A234423 a(n) = the smallest multiple of prime(n) such that a(n) == j-1 (mod j) for each integer j with 1 <= j < prime(n).

Table of values

n a(n)
1 2
2 3
3 35
4 119
5 2519
6 277199
7 5045039
8 183783599
9 4655851199
10 80313433199
11 32607253879199
12 2743667504978399
13 58772246027695199
14 5038384364010597599

List of values

[2, 3, 35, 119, 2519, 277199, 5045039, 183783599, 4655851199, 80313433199, 32607253879199, 2743667504978399, 58772246027695199, 5038384364010597599]