|
%I #15 Mar 06 2020 15:48:17
%S 1,0,1,1,1,1,1,2,1,2,2,3,2,3,4,4,5,5,4,6,8,8,6,7,10,11,11,15,15,16,18,
%T 21,22,23,29,33,31,31,39,43,44,52,51,58,64,71,66,82,88,96,93,103,115,
%U 128,143,150,156,160,173,199,202,202,242,263,269,293,308
%N a(n) is the number of degrees in the sequence of the degrees of the irreducible representations of the symmetric group S_n that appear only once.
%C Bounded above by A000700(n). - _Eric M. Schmidt_, Apr 29 2013
%e a(6) = 1 because the degrees for S_6 are 1,1,5,5,5,5,9,9,10,10,16 and the only number that appears once is 16.
%o (Sage)
%o def A060426(n) :
%o mult = {}
%o for P in Partitions(n) :
%o dim = P.dimension()
%o mult[dim] = mult.get(dim, 0) + 1
%o return len([m for m in iter(mult) if mult[m]==1])
%o # _Eric M. Schmidt_, Apr 29 2013
%Y Cf. A059867, A060368, A060369, A060437, A061569, A089248. [From _M. F. Hasler_, Jun 14 2009]
%K nonn
%O 1,8
%A Avi Peretz (njk(AT)netvision.net.il), Apr 05 2001
%E More terms from _Eric M. Schmidt_, Apr 29 2013
|
