|
Search: id:A060350
|
|
|
| A060350 |
|
The sum over all subsets S of [n] of the squares of the number of permutations with descent set =S. |
|
+0
2
|
|
| 1, 2, 10, 88, 1216, 24176, 654424, 23136128, 1035227008, 57186502912, 3822411268864, 304059285928960, 28385946491599360, 3073391215118186496, 381995951933025287680
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
a(1)=1^2; a(2)=1^2+1^2; a(3)=1^2+2^2+2^2+1^2; a(4)=1^2+3^2+5^2+3^2+3^2+5^2+3^2+1^2;
|
|
MAPLE
|
ct := proc(k) option remember; local i, out, n; if k=0 then RETURN(1); fi; n := floor(evalf(log[2](k)))+1; if k=2^n or k=2^(n+1)-1 then RETURN(1); fi; out := 0; for i from 1 to n do if irem(iquo(k, 2^(i-1)), 2) = 1 and irem(iquo(2*k, 2^(i-1)), 2) =0 then out := out+(n-1)!/(i-1)!/(n-i)!* ct(floor(irem(k, 2^(i-1))+2^(i-2)))*ct(iquo(k, 2^i)); fi; od; out; end: seq(add(ct(i)^2, i=2^(n-1)..2^n-1), n=1..15);
|
|
CROSSREFS
|
Cf. A060351.
Sequence in context: A065866 A132397 A111811 this_sequence A096658 A055779 A067550
Adjacent sequences: A060347 A060348 A060349 this_sequence A060351 A060352 A060353
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Mike Zabrocki (zabrocki(AT)mathstat.yorku.ca), Mar 31 2001
|
|
|
Search completed in 0.002 seconds
|
