login

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”).

A333082
Number of permutations sigma of [n] such that all values sigma(k)/k for 1 <= k <= n are pairwise distinct.
2
1, 1, 1, 5, 13, 79, 345, 2785, 19595, 171141, 1555181, 18998391, 184988197, 2675065491, 35582840563, 490186693669
OFFSET
0,4
MATHEMATICA
Table[ Count[ Length[ Union[ #/ Range[n]]] & /@ Permutations[ Range@n], n], {n, 0, 9}] (* Giovanni Resta, Mar 09 2020 *)
PROG
(Ruby)
def A(n)
(1..n).to_a.permutation.select{|i| (1..n).map{|j| i[j - 1] / j.to_r}.uniq.size == n}.size
end
def A333082(n)
(0..n).map{|i| A(i)}
end
p A333082(9)
CROSSREFS
Cf. A333083.
Sequence in context: A027612 A027457 A113876 * A214536 A363015 A324418
KEYWORD
nonn,more
AUTHOR
Seiichi Manyama, Mar 07 2020
EXTENSIONS
a(13)-a(15) from Giovanni Resta, Mar 09 2020
STATUS
approved