login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A178021 Number of permutations of 3 copies of 1..n with no element e[i>=2]<e[1+floor((i-2)/6)] (6-way heap) 0

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

%S 1,10,250,22500,2788800,1002405600,359463283200,326108342112000,

%T 257963213378304000

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

%Y Simple 2-way heap A056971

%K nonn

%O 1,2

%A _R. H. Hardin_ May 17 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 18:16 EDT 2024. Contains 371916 sequences. (Running on oeis4.)