Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #33 Oct 18 2014 19:05:29
%S 0,1,1,2,5,12,33,94,290,949,3245,11666,43731,170748,689957,2887816,
%T 12458783,55406276,253142181,1187931688,5712032811,28131119950,
%U 141645386201,728841245442,3827217750406,20499431084637,111876916513388,621831333931916,3516904353610571
%N Number of tableaux of size n with major index (sum of descent set) equal to 1 mod n.
%C Related to sum of characters of Lie(n).
%H Alois P. Heinz, <a href="/A225616/b225616.txt">Table of n, a(n) for n = 1..40</a>
%H R. P. Stanley, <a href="http://www-math.mit.edu/~rstan/transparencies/whouse.pdf">Whitehouse</a>
%F a(n) = Sum_{k=0..n(n-1)/2, k mod n=1} A232439(n,k). - _Alois P. Heinz_, Sep 15 2014
%t descentset[t_?TableauQ]:=Sort[Cases[t,i_Integer /; Position[t,i+1][[1,1]] > Position[t,i][[1,1]], {2}]];
%t majorindex[t_?TableauQ]:=Tr[descentset[t]];
%t Table[Tr[Count[Tableaux[#],(q_/;Mod[majorindex[q],Tr[#]]==1) ]& /@ Partitions[n]],{n,13}]
%Y Cf. A232439.
%K nonn
%O 1,4
%A _Wouter Meeussen_, Aug 04 2013
%E Terms verified and more terms added, _Joerg Arndt_, Aug 04 2013
%E a(21)-a(24) from _Alois P. Heinz_, Aug 08 2013
%E a(25) from _Alois P. Heinz_, Aug 12 2013
%E a(26)-a(29) from _Alois P. Heinz_, Sep 15 2014