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.

A191836 The slowest growing sequence that satisfies: a(1) = 1, a(n) is a multiple of n and a(n-1), and a(n) > a(n-1).

Table of values

n a(n)
1 1
2 2
3 6
4 12
5 60
6 120
7 840
8 1680
9 5040
10 10080
11 110880
12 221760
13 2882880
14 5765760
15 11531520
16 23063040
17 392071680
18 784143360
19 14898723840
20 29797447680
21 59594895360
22 119189790720
23 2741365186560
24 5482730373120
25 27413651865600
26 54827303731200
27 164481911193600
28 328963822387200

List of values

[1, 2, 6, 12, 60, 120, 840, 1680, 5040, 10080, 110880, 221760, 2882880, 5765760, 11531520, 23063040, 392071680, 784143360, 14898723840, 29797447680, 59594895360, 119189790720, 2741365186560, 5482730373120, 27413651865600, 54827303731200, 164481911193600, 328963822387200]