|
%I #32 Aug 25 2023 18:00:07
%S 1,2,21,52,905,2436,58513,165096,5053329,14690260,546376721,
%T 1621207512,70973853145,213746971816,10765350278145,32788134075856,
%U 1867372988701217,5737757882873652,364586039726904145,1128184012390456440,79120980149003612841
%N a(n) is the number of endofunctions on an n-set where there is an element with a preimage of cardinality greater than n/2.
%C For a random map, f:N->N, |N|=n, the probability of having a preimage of cardinality greater than n/2 is
%C a(n)/A000312(n) = n*Sum_{k=0..floor((n-1)/2)} binomial(n,k)*(1-1/n)^k*(1/n)^(n-k).
%C The number of maps g:V->C, |V|=v, |C|=c such that there exists x in C, |g^-1(x)| > v/2, is
%C b(c,v) = c * Sum_{k=0..floor((v-1)/2)} binomial(v,k)*(c-1)^k;
%C b(n,n) = a(n), b(2,n) = A202736(n), b(c,1) = b(c,2) = c.
%H Alois P. Heinz, <a href="/A351118/b351118.txt">Table of n, a(n) for n = 1..592</a>
%F a(n) = n * Sum_{k=0..floor((n-1)/2)} binomial(n,k)*(n-1)^k.
%t a[1] = 1; a[n_] := n * Sum[(n - 1)^k*Binomial[n, k], {k, 0, Floor[(n - 1)/2]}]; Array[a, 20] (* _Amiram Eldar_, Feb 01 2022 *)
%o (PARI) a(n) = n*sum(k=0,floor((n-1)/2), binomial(n,k)*(n-1)^k)
%Y Cf. A000312 (endofunctions).
%K nonn
%O 1,2
%A _Aaron O. Schweiger_, Jan 31 2022
|
