A324806 a(n) is the number of endofunctions on a set of size n with preimage constraint {0, 1, 2, 3, 4, 5, 6}.

1, 1, 4, 27, 256, 3125, 46656, 823536, 16776760, 387399096, 9999087840, 285273493890, 8914479240744, 302804132739108, 11108778138153696, 437740674563572380, 18439146872674688160, 826846479804875930400, 39325078741869629444736, 1977213223548343109320992

Offset

0,3

Comments

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.

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.

Links

Table of n, a(n) for n=0..19.

B. Otto, Coalescence under Preimage Constraints, arXiv:1903.00542 [math.CO], 2019, Corollaries 5.6 and 7.8.

Formula

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.

Maple

b:= proc(n, i) option remember; `if`(n=0 and i=0, 1, `if`(i<1, 0,
      add(b(n-j, i-1)*binomial(n, j), j=0..min(6, n))))
    end:
a:= n-> b(n$2):
seq(a(n), n=0..20);  # Alois P. Heinz, Apr 01 2019

Mathematica

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]}]]];
a[n_] := b[n, n];
Table[a[n], {n, 0, 20}] (* Jean-François Alcover, May 31 2019, after Alois P. Heinz *)

Prog

(Python)
# print first num_entries entries in the sequence
import math, sympy; x=sympy.symbols('x')
k=6; num_entries = 64
P=range(k+1); eP=sum([x**d/math.factorial(d) for d in P]); r = [1]; curr_pow = 1
for term in range(1, num_entries):
...curr_pow=(curr_pow*eP).expand()
...r.append(curr_pow.coeff(x**term)*math.factorial(term))
print(r)

Crossrefs

Column k=6 of A306800; see that entry for sequences related to other preimage constraints constructions.

Sequence in context: A190125 A324805 A245410 * A245411 A324807 A245412

Adjacent sequences: A324803 A324804 A324805 * A324807 A324808 A324809

Keyword

easy,nonn

Author

Benjamin Otto, Mar 25 2019

Status

approved