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.

A121934 Smallest positive number m such that m == i (mod i+1) for all 1<=i<=n.

Table of values

n a(n)
1 1
2 1
3 5
4 11
5 59
6 59
7 419
8 839
9 2519
10 2519
11 27719
12 27719
13 360359
14 360359
15 360359
16 720719
17 12252239
18 12252239
19 232792559
20 232792559
21 232792559
22 232792559
23 5354228879
24 5354228879
25 26771144399
26 26771144399
27 80313433199
28 80313433199

List of values

[1, 1, 5, 11, 59, 59, 419, 839, 2519, 2519, 27719, 27719, 360359, 360359, 360359, 720719, 12252239, 12252239, 232792559, 232792559, 232792559, 232792559, 5354228879, 5354228879, 26771144399, 26771144399, 80313433199, 80313433199]