A260340 Triangle read by rows: T(n,k) = number of sets of linear n-ads in k variables.
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 6, 1, 1, 1, 1, 22, 22, 1, 1, 1, 1, 130, 550, 130, 1, 1, 1, 1, 822, 16700, 16700, 822, 1, 1, 1, 1, 6202, 703297, 3330915, 703297, 6202, 1, 1, 1, 1, 52552, 38135272, 957659906, 957659906, 38135272, 52552, 1, 1
Offset: 0
Examples
Triangle begins: 1; 1, 1; 1, 1, 1; 1, 1, 1, 1; 1, 1, 6, 1, 1; 1, 1, 22, 22, 1, 1; 1, 1, 130, 550, 130, 1, 1; 1, 1, 822, 16700, 16700, 822, 1, 1; 1, 1, 6202, 703297, 3330915, 703297, 6202, 1, 1; ...
Links
- Andrew Howroyd, Table of n, a(n) for n = 0..230 (rows 0..20)
- P. A. MacMahon, Combinations derived from m identical sets of n different letters and their connexion with general magic squares, Proc. London Math. Soc., 17 (1917), 25-41.
Crossrefs
Formula
T(n,k) = T(n,n-k). - Andrew Howroyd, Apr 18 2020
Extensions
Extended to include k=0 and more terms added by Andrew Howroyd, Apr 18 2020
Comments