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.

A094302 a(1) = 1; if n > a(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)
1 1
2 2
3 6
4 3
5 15
6 5
7 35
8 35
9 35
10 7
11 77
12 77
13 77
14 11
15 165
16 165
17 165
18 55
19 55
20 11
21 231
22 21
23 483
24 161
25 161
26 161
27 161
28 23
29 667
30 667
31 667
32 667
33 667
34 667
35 667
36 667
37 667
38 667
39 667
40 667
41 667
42 667
43 667
44 667
45 667
46 29
47 1363
48 1363
49 1363
50 1363
51 1363
52 1363
53 1363
54 1363
55 1363
56 1363

List of values

[1, 2, 6, 3, 15, 5, 35, 35, 35, 7, 77, 77, 77, 11, 165, 165, 165, 55, 55, 11, 231, 21, 483, 161, 161, 161, 161, 23, 667, 667, 667, 667, 667, 667, 667, 667, 667, 667, 667, 667, 667, 667, 667, 667, 667, 29, 1363, 1363, 1363, 1363, 1363, 1363, 1363, 1363, 1363, 1363]