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.

A249831 A(n,n) = 1, A(n,k) = A(n,k+1)*k / gcd(A(n,k+1),k)^2 if n>k, A(n,k) = A(n,k-1)*k / gcd(A(n,k-1),k)^2 if n square array A(n,k), n>=1, k>=1, read by antidiagonals.

Table of values

n a(n)
1 1
2 2
3 1
4 6
5 1
6 2
7 6
8 3
9 2
10 6
11 30
12 12
13 1
14 6
15 6
16 5
17 60
18 4
19 3
20 6
21 30
22 35
23 10
24 20
25 1
26 12
27 30
28 5
29 280
30 70
31 30
32 5
33 4
34 60
35 5
36 35
37 2520
38 140
39 210
40 30
41 1
42 20
43 10
44 35
45 70
46 252
47 1260
48 420
49 210
50 6
51 5
52 30
53 70
54 70
55 70
56 2772
57 126
58 420
59 420
60 42
61 1
62 30
63 210
64 35
65 70
66 7

List of values

[1, 2, 1, 6, 1, 2, 6, 3, 2, 6, 30, 12, 1, 6, 6, 5, 60, 4, 3, 6, 30, 35, 10, 20, 1, 12, 30, 5, 280, 70, 30, 5, 4, 60, 5, 35, 2520, 140, 210, 30, 1, 20, 10, 35, 70, 252, 1260, 420, 210, 6, 5, 30, 70, 70, 70, 2772, 126, 420, 420, 42, 1, 30, 210, 35, 70, 7]