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!)
A309807 Number of permutations sigma of [n] such that sigma(k)/k > sigma(k+1)/(k+1) for 1 <= k <= n-1. 4

%I #54 Mar 15 2020 05:53:20

%S 1,1,1,2,3,6,9,19,30,60,108,222,388,874,1601,3244,6437,14056,26545,

%T 57326,109333,232751,481137,1002039,1911740,4261276,8678424,17734328,

%U 36186279,77402058,154454851,340848002,691228119,1460761640

%N Number of permutations sigma of [n] such that sigma(k)/k > sigma(k+1)/(k+1) for 1 <= k <= n-1.

%C a(n+1) is equal to the number of permutations sigma of [n] such that sigma(k)/k >= sigma(k+1)/(k+1) for 1 <= k <= n-1.

%H Mathematics.StackExchange, <a href="https://math.stackexchange.com/questions/3572301/why-are-the-numbers-of-two-different-permutations-the-same">Why are the numbers of two different permutations the same?</a>, Mar 07 2020.

%e In case of n = 3.

%e ----+----------

%e 1 | [2, 3, 1]

%e 2 | [3, 2, 1]

%e In case of n = 4.

%e ----+-------------

%e 1 | [2, 3, 4, 1]

%e 2 | [3, 4, 2, 1]

%e 3 | [4, 3, 2, 1]

%o (Ruby)

%o def A(n)

%o (1..n).to_a.permutation.select{|i| (1..n - 1).all?{|j| i[j - 1] * (j + 1) > i[j] * j}}.size

%o end

%o def A309807(n)

%o (0..n).map{|i| A(i)}

%o end

%o p A309807(10)

%Y Row sums of A333310.

%Y Cf. A330432, A332954.

%K nonn,more

%O 0,4

%A _Seiichi Manyama_, Mar 03 2020

%E a(19)-a(22) from _Alois P. Heinz_, Mar 03 2020

%E a(23)-a(25) from _Giovanni Resta_, Mar 04 2020

%E a(26)-a(33) from _Bert Dobbelaere_, Mar 15 2020

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 28 04:07 EDT 2024. Contains 372020 sequences. (Running on oeis4.)