login
Triangular array read by rows: T(n,k) = number of k-dimensional isotropic subspaces of Spin(2n+1,C), n >= 1, 1 <= k <= n.
2

%I #29 Feb 16 2022 23:21:56

%S 1,3,3,5,7,6,7,11,12,10,9,15,18,18,15,11,19,24,26,25,21,13,23,30,34,

%T 35,33,28,15,27,36,42,45,45,42,36,17,31,42,50,55,57,56,52,45,19,35,48,

%U 58,65,69,70,68,63,55,21,39,54,66,75,81,84,84,81,75,66,23,43,60,74,85,93

%N Triangular array read by rows: T(n,k) = number of k-dimensional isotropic subspaces of Spin(2n+1,C), n >= 1, 1 <= k <= n.

%H G. C. Greubel, <a href="/A070543/b070543.txt">Rows n = 1..100 of triangle, flattened</a>

%H John Baez, <a href="http://math.ucr.edu/home/baez/week181.html">Week 181</a>

%F T(n, k) = k*(k+1)/2 + 2*k*(n-k) if 0 < k <= n.

%F G.f.: (1+x-2*x^2*y)/((1-x)^2*(1-x*y)^3). - _Vladeta Jovovic_, Mar 05 2004

%F T(n, k) = A141419(2*n-k, k). - _Peter Munn_, Aug 21 2019

%e Rows:

%e 1;

%e 3, 3;

%e 5, 7, 6;

%e 7, 11, 12, 10;

%e 9, 15, 18, 18, 15;

%e 11, 19, 24, 26, 25, 21;

%e ...

%p T:=(n,k) -> k*(k+1)/2+2*k*(n-k); r:=n->[seq(T(n,k),k=1..n)]; for r from 1 to 12 do lprint(r(n)); od: # _N. J. A. Sloane_, Aug 21 2019

%t nmax = 12; t[n_, k_] := If[k < 1 || k > n, 0, k*(k+1)/2 + 2*k*(n-k)]; Flatten[ Table[t[n , k], {n, 1, nmax}, {k, 1, n}]] (* _Jean-François Alcover_, Oct 19 2011, after PARI *)

%o (PARI) {T(n, k) = if( k<1 || k>n, 0, k * (k + 1) / 2 + 2 * k * (n - k))}

%o (Magma) [k*(k+1 + 4*(n-k))/2: k in [1..n], n in [1..12]]; // _G. C. Greubel_, Sep 05 2019

%o (Sage) [[k*(k+1 + 4*(n-k))/2 for k in (1..n)] for n in (1..12)] # _G. C. Greubel_, Sep 05 2019

%o (GAP) Flat(List([1..12], n-> List([1..n], k-> k*(k+1 + 4*(n-k))/2 ))); # _G. C. Greubel_, Sep 05 2019

%Y Cf. A141419.

%K nonn,tabl,easy,nice

%O 1,2

%A _Michael Somos_, Apr 28 2002

%E Offset changed to 1 by _N. J. A. Sloane_, Aug 21 2019