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!)
A180388 Number of permutations of 1..n with number of rises (p(i+1)>p(i)) different from number of rises in the inverse permutation. 2

%I #14 Jun 10 2015 14:13:45

%S 0,0,0,0,2,24,228,2088,19732,197890,2131060,24729108,309027560,

%T 4148115048,59611031304,913915160628,14897443573244,257369478424890,

%U 4698494631208500,90393611677083892,1828153614233855024,38778554791649355232,860921156414834534368

%N Number of permutations of 1..n with number of rises (p(i+1)>p(i)) different from number of rises in the inverse permutation.

%H Vaclav Kotesovec, <a href="/A180388/b180388.txt">Table of n, a(n) for n = 0..200</a>

%Y a(n) + A180389(n) = n! = A000142(n).

%K nonn

%O 0,5

%A _Leroy Quet_, _D. S. McNeil_ and _R. H. Hardin_ in the Sequence Fans Mailing List Sep 01 2010

%E More terms from _Vaclav Kotesovec_, Jun 10 2015

%E a(0)=0 prepended by _Alois P. Heinz_, Jun 10 2015

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 May 6 13:11 EDT 2024. Contains 372293 sequences. (Running on oeis4.)