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.

A339100 a(n) = GCD({(2*n-k)*T(n,k)+(k+1)*T(n,k+1), k=0..n}), where T(n,k) stands for A214406 (the second-order Eulerian numbers of type B).

Table of values

n a(n)
1 1
2 6
3 1
4 60
5 1
6 42
7 1
8 120
9 1
10 66
11 1
12 5460
13 1
14 6
15 1
16 4080
17 1
18 798
19 1
20 3300
21 1
22 138
23 1
24 10920
25 1
26 6
27 1
28 1740
29 1
30 14322
31 1
32 8160
33 1
34 6
35 1
36 3838380
37 1
38 6
39 1
40 270600
41 1
42 12642
43 1
44 1380
45 1
46 282
47 1
48 371280
49 1
50 66
51 1
52 3180
53 1
54 798
55 1
56 3480
57 1
58 354
59 1
60 567867300

List of values

[1, 6, 1, 60, 1, 42, 1, 120, 1, 66, 1, 5460, 1, 6, 1, 4080, 1, 798, 1, 3300, 1, 138, 1, 10920, 1, 6, 1, 1740, 1, 14322, 1, 8160, 1, 6, 1, 3838380, 1, 6, 1, 270600, 1, 12642, 1, 1380, 1, 282, 1, 371280, 1, 66, 1, 3180, 1, 798, 1, 3480, 1, 354, 1, 567867300]