Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #19 Mar 09 2020 09:14:03
%S 1,1,1,5,13,79,345,2785,19595,171141,1555181,18998391,184988197,
%T 2675065491,35582840563,490186693669
%N Number of permutations sigma of [n] such that all values sigma(k)/k for 1 <= k <= n are pairwise distinct.
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Permutation">Permutation</a>
%t Table[ Count[ Length[ Union[ #/ Range[n]]] & /@ Permutations[ Range@n], n], {n, 0, 9}] (* _Giovanni Resta_, Mar 09 2020 *)
%o (Ruby)
%o def A(n)
%o (1..n).to_a.permutation.select{|i| (1..n).map{|j| i[j - 1] / j.to_r}.uniq.size == n}.size
%o end
%o def A333082(n)
%o (0..n).map{|i| A(i)}
%o end
%o p A333082(9)
%Y Cf. A333083.
%K nonn,more
%O 0,4
%A _Seiichi Manyama_, Mar 07 2020
%E a(13)-a(15) from _Giovanni Resta_, Mar 09 2020