OFFSET
1,4
COMMENTS
LINKS
Paolo Xausa, Table of n, a(n) for n = 1..11325 (rows 1..150 of triangle, flattened).
Wolfdieter Lang, First 9 rows.
FORMULA
T(n, m) = binomial(2*n, 2*m+1)/(2*b(n)), n>=m+1>=1, else 0, with b(n) := GCD(seq(binomial(2*n, 2*m+1)/2, m=0..n-1)), where GCD denotes the greatest common divisor of a set of numbers (here one half of the odd numbered entries in the even numbered rows of Pascal's triangle). It suffices to consider m=0..floor((n-1)/2) due to symmetry.
EXAMPLE
MATHEMATICA
A091043row[n_] := # / GCD @@ # & [Binomial[2*n, 2*Range[n] - 1]];
Array[A091043row, 12] (* Paolo Xausa, May 07 2026 *)
PROG
(PARI) row(n) = my(v=vector(n, k, binomial(2*n, 2*k-1))); v/gcd(v); \\ Michel Marcus, May 06 2026
CROSSREFS
KEYWORD
AUTHOR
Wolfdieter Lang, Jan 23 2004
EXTENSIONS
More terms from Michel Marcus, May 06 2026
STATUS
approved