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.

A092461 Let S_n be the set {n!/(i!*j!*k!) | i, j, k > 0, i+j+k = n} (i.e., trinomial coefficients that involve all three monomials). Then a(n) is the smallest gcd of any three members of S_n.

Table of values

n a(n)
3 6
4 12
5 10
6 30
7 7
8 28
9 6
10 30
11 11
12 66
13 13
14 91
15 6
16 12
17 34
18 102
19 19
20 38
21 12
22 22
23 23
24 46
25 15
26 65
27 6
28 12
29 29
30 435
31 62
32 124
33 6
34 34
35 10
36 36
37 37
38 703
39 6
40 24
41 41
42 82
43 86
44 43
45 20
46 46
47 47
48 94
49 21
50 70
51 6
52 12
53 53
54 159
55 10
56 35
57 21
58 58
59 59
60 177
61 61
62 1891
63 14
64 28
65 10
66 30
67 67
68 134
69 12
70 14
71 142
72 142

List of values

[6, 12, 10, 30, 7, 28, 6, 30, 11, 66, 13, 91, 6, 12, 34, 102, 19, 38, 12, 22, 23, 46, 15, 65, 6, 12, 29, 435, 62, 124, 6, 34, 10, 36, 37, 703, 6, 24, 41, 82, 86, 43, 20, 46, 47, 94, 21, 70, 6, 12, 53, 159, 10, 35, 21, 58, 59, 177, 61, 1891, 14, 28, 10, 30, 67, 134, 12, 14, 142, 142]