|
%I #11 May 31 2019 07:22:55
%S 1,1,4,27,256,3125,46656,823536,16776760,387399096,9999087840,
%T 285273493890,8914479240744,302804132739108,11108778138153696,
%U 437740674563572380,18439146872674688160,826846479804875930400,39325078741869629444736,1977213223548343109320992
%N a(n) is the number of endofunctions on a set of size n with preimage constraint {0, 1, 2, 3, 4, 5, 6}.
%C A preimage constraint is a set of nonnegative integers such that the size of the inverse image of any element is one of the values in that set.
%C Thus, the n-th term of the sequence is the number of endofunctions on a set of size n such that each preimage has at most 6 elements. Equivalently, it is the number of n-letter words from an n-letter alphabet such that no letter appears more than 6 times.
%H B. Otto, <a href="https://arxiv.org/abs/1903.00542">Coalescence under Preimage Constraints</a>, arXiv:1903.00542 [math.CO], 2019, Corollaries 5.6 and 7.8.
%F a(n) = n! * [x^n] e_6(x)^n, where e_k(x) is the truncated exponential 1 + x+ x^2/2! + ... + x^k/k!. The link above yields explicit constants c_k, r_k so that the columns are asymptotically c_6 * n^(-1/2) * r_6^-n.
%p b:= proc(n, i) option remember; `if`(n=0 and i=0, 1, `if`(i<1, 0,
%p add(b(n-j, i-1)*binomial(n, j), j=0..min(6, n))))
%p end:
%p a:= n-> b(n$2):
%p seq(a(n), n=0..20); # _Alois P. Heinz_, Apr 01 2019
%t b[n_, i_] := b[n, i] = If[n == 0 && i == 0, 1, If[i<1, 0, Sum[b[n-j, i-1]* Binomial[n, j], {j, 0, Min[6, n]}]]];
%t a[n_] := b[n, n];
%t Table[a[n], {n, 0, 20}] (* _Jean-François Alcover_, May 31 2019, after _Alois P. Heinz_ *)
%o (Python)
%o # print first num_entries entries in the sequence
%o import math, sympy; x=sympy.symbols('x')
%o k=6; num_entries = 64
%o P=range(k+1); eP=sum([x**d/math.factorial(d) for d in P]); r = [1]; curr_pow = 1
%o for term in range(1,num_entries):
%o ...curr_pow=(curr_pow*eP).expand()
%o ...r.append(curr_pow.coeff(x**term)*math.factorial(term))
%o print(r)
%Y Column k=6 of A306800; see that entry for sequences related to other preimage constraints constructions.
%K easy,nonn
%O 0,3
%A _Benjamin Otto_, Mar 25 2019
|
