login
Number of permutations of 3 copies of 1..n with no element e[i>=2]<e[1+floor((i-2)/2)] (2-way heap)
0

%I #3 Mar 31 2012 12:35:44

%S 1,4,38,820,42928,2352068,273609756,39956342600,10520852944576

%N Number of permutations of 3 copies of 1..n with no element e[i>=2]<e[1+floor((i-2)/2)] (2-way heap)

%Y Simple 2-way heap A056971

%K nonn

%O 1,2

%A _R. H. Hardin_ May 17 2010