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.

A108774 Sum of the squares of numbers of chess tableaux over all partitions of n.

This page as a plain text file.
%I A108774 #19 Jun 08 2015 06:00:26
%S A108774 1,1,2,2,4,8,16,48,160,448,2048,6400,31232,125952,604160,3119104,
%T A108774 15638528,93478912,550141952,3367698432,24049516544,146207539200,
%U A108774 1203934593024,7615928598528,67190404415488,468355947429888,4196459066949632,33260378783744000
%N A108774 Sum of the squares of numbers of chess tableaux over all partitions of n.
%H A108774 Alois P. Heinz, <a href="/A108774/b108774.txt">Table of n, a(n) for n = 0..50</a>
%H A108774 T. Y. Chow, H. Eriksson and C. K. Fan, <a href="http://www.combinatorics.org/Volume_11/Abstracts/v11i2a3.html">Chess tableaux</a>, Elect. J. Combin., 11 (2) (2005), #A3.
%F A108774 a(n) = Sum_{lambda : partitions(n)} chess(lambda)^2, where chess(k) is the number of standard Young tableaux (SYT) with cell(i,j)+i+j == 1 mod 2. - _Alois P. Heinz_, Jun 30 2012
%p A108774 b:= proc() option remember; local s; s:= add(i, i=args); `if`(s=0, 1,
%p A108774       add(`if`(irem(s+i-args[i], 2)=1 and args[i]>`if`(i=nargs, 0,
%p A108774       args[i+1]), b(subsop(i=args[i]-1, [args])[]), 0), i=1..nargs))
%p A108774     end:
%p A108774 g:= (n, i, l)-> `if`(n=0 or i=1, b(l[], 1$n)^2, `if`(i<1, 0,
%p A108774                  add(g(n-i*j, i-1, [l[], i$j]), j=0..n/i))):
%p A108774 a:= n-> `if`(n<2, 1, g(n, n, [])):
%p A108774 seq(a(n), n=0..27);  # _Alois P. Heinz_, Jul 01 2012
%t A108774 b[args_List] := b[args] = Module[{s=Total[args], nargs=Length[args]}, If[s == 0, 1, Sum[If[Mod[s+i-args[[i]], 2] == 1 && args[[i]] > If[i == nargs, 0, args[[i+1]] ], b[ReplacePart[args, i -> args[[i]]-1]], 0], {i, 1, nargs}] ] ]; g[n_, i_, l_List] := g[n, i, l] = If[n == 0 || i == 1, b[Join[l, Array[1&, n]]]^2, If[i<1, 0, Sum[g[n-i*j, i-1, Join[l, Array[i&, j]]], {j, 0, n/i}] ] ]; a[n_] := If[n<2, 1, g[n, n, {}]]; Table[a[n], {n, 0, 27}] (* _Jean-François Alcover_, Jun 08 2015, after _Alois P. Heinz_ *)
%Y A108774 Cf. A214087.
%K A108774 nonn
%O A108774 0,3
%A A108774 _N. J. A. Sloane_, Jun 27 2005
%E A108774 More terms from _Alois P. Heinz_, Jun 30 2012