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.

A084717 a(1) = 3 then a(n) = smallest multiple of a(n-1) > a(n-1) such that a(n) - 1 is a prime.

Table of values

n a(n)
1 3
2 6
3 12
4 24
5 48
6 192
7 384
8 1152
9 6912
10 27648
11 138240
12 691200
13 3456000
14 34560000
15 138240000
16 414720000
17 2073600000
18 16588800000
19 364953600000
20 4744396800000
21 66421555200000
22 132843110400000
23 664215552000000
24 3321077760000000
25 6642155520000000
26 132843110400000000

List of values

[3, 6, 12, 24, 48, 192, 384, 1152, 6912, 27648, 138240, 691200, 3456000, 34560000, 138240000, 414720000, 2073600000, 16588800000, 364953600000, 4744396800000, 66421555200000, 132843110400000, 664215552000000, 3321077760000000, 6642155520000000, 132843110400000000]