19840464
domain: N
Appears in sequences
- Triangle whose (i,j)-th entry is binomial(i,j)*4^(i-j)*9^j.at n=33A038239
- Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*4^j.at n=30A038294
- a(n) = number of endofunctions on [n] with a 4-cycle a->b->c->d->a and for any x in [n], some iterate f^k(x) = a.at n=5A065888
- Triangular array read by rows. T(n,k) is the number of connected endofunctions on {1,2,...,n} that have exactly k nodes in the unique cycle of its digraph representation.at n=39A201685
- Triangle read by rows: terms T(n,k) of a binomial decomposition of n^n as Sum(k=0..n)T(n,k).at n=48A244121
- Number of endofunctions on [n] where the largest cycle length equals 5.at n=4A246215