login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A178020 Number of permutations of 3 copies of 1..n with no element e[i>=2]<e[1+floor((i-2)/5)] (5-way heap) 0
1, 10, 200, 13440, 2097900, 442030200, 257134170000, 122150707608000, 111415794466080000, 163780469919918720000 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..10.

CROSSREFS

Simple 2-way heap A056971

Sequence in context: A156275 A036362 A051262 * A041183 A210168 A041180

Adjacent sequences:  A178017 A178018 A178019 * A178021 A178022 A178023

KEYWORD

nonn

AUTHOR

R. H. Hardin May 17 2010

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified December 8 09:03 EST 2016. Contains 278906 sequences.