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.

A094299 a(0) = 1; for n>0, if gcd(a(n-1),n) = 1 then a(n) = n*a(n-1) else a(n) = least integer multiple of a(n-1)/n.

Table of values

n a(n)
0 1
1 1
2 2
3 6
4 3
5 15
6 5
7 35
8 280
9 2520
10 252
11 2772
12 231
13 3003
14 429
15 143
16 2288
17 38896
18 19448
19 369512
20 92378
21 1939938
22 88179
23 2028117
24 676039
25 16900975
26 1300075
27 35102025
28 5014575
29 145422675
30 9694845
31 300540195
32 9617286240
33 3205762080
34 94287120

List of values

[1, 1, 2, 6, 3, 15, 5, 35, 280, 2520, 252, 2772, 231, 3003, 429, 143, 2288, 38896, 19448, 369512, 92378, 1939938, 88179, 2028117, 676039, 16900975, 1300075, 35102025, 5014575, 145422675, 9694845, 300540195, 9617286240, 3205762080, 94287120]