|
|
|
|
1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 16, 24, 16, 1, 1, 5, 40, 40, 5, 1, 1, 864, 2160, 11520, 2160, 864, 1, 1, 7, 3024, 5040, 5040, 3024, 7, 1, 1, 2048, 7168, 2064384, 645120, 2064384, 7168, 2048, 1, 1, 729, 746496, 1741824, 94058496, 94058496, 1741824, 746496, 729, 1
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,5
|
|
COMMENTS
|
It appears that the T(n,k) are always integers. This would follow from the conjectured prime factorization given in A092287. Calculation suggests that the binomial coefficients C(n,k) divide T(n,k) and indeed that T(n,k)/C(n,k) are perfect squares.
|
|
LINKS
|
|
|
FORMULA
|
T(n, k) = (Product_{i=1..n} Product_{j=1..n} gcd(i,j)) / ( (Product_{i=1..n-k} Product_{j=1..n-k} gcd(i,j)) * ( Product_{i=1..k} Product_{j=1..k} gcd(i,j)) ), note that empty products equal to 1.
|
|
EXAMPLE
|
Triangle starts:
1;
1, 1;
1, 2, 1;
1, 3, 3, 1;
1, 16, 24, 16, 1;
1, 5, 40, 40, 5, 1;
|
|
MATHEMATICA
|
A092287[n_]:= Product[GCD[j, k], {j, n}, {k, n}];
|
|
PROG
|
(Magma)
A092287:= func< n | n eq 0 select 1 else (&*[(&*[GCD(j, k): k in [1..n]]): j in [1..n]]) >;
(SageMath)
def A092287(n): return product(product( gcd(j, k) for k in range(1, n+1)) for j in range(1, n+1))
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|