|
%I #12 Jun 15 2018 09:28:24
%S 1,1,3,18,157,1776,24807,413344,8004537,176630400,4374300331,
%T 120136735104,3623854678677,119102912981248,4236492477409935,
%U 162152320065532416,6645233337842716273,290321208589666369536,13469914225467040015827,661442143465113960448000
%N Number of endofunctions on [n] whose cycle lengths are triangular numbers.
%H Alois P. Heinz, <a href="/A305824/b305824.txt">Table of n, a(n) for n = 0..386</a>
%p b:= proc(n) option remember; local r, f, g;
%p if n=0 then 1 else r, f, g:=$0..2;
%p while f<=n do r, f, g:= r+(f-1)!*
%p b(n-f)*binomial(n-1, f-1), f+g, g+1
%p od; r fi
%p end:
%p a:= n-> add(b(j)*n^(n-j)*binomial(n-1, j-1), j=0..n):
%p seq(a(n), n=0..20);
%t b[n_] := b[n] = Module[{r, f, g}, If[n == 0, 1, {r, f, g} = {0, 1, 2}; While[f <= n, {r, f, g} = {r + (f - 1)!*b[n - f]*Binomial[n - 1, f - 1], f + g, g + 1}]; r]];
%t a[0] = 1; a[n_] := Sum[b[j]*n^(n - j)*Binomial[n - 1, j - 1], {j, 0, n}];
%t Table[a[n], {n, 0, 20}] (* _Jean-François Alcover_, Jun 15 2018, after _Alois P. Heinz_ *)
%Y Cf. A000217, A060435, A116956, A193374, A205799, A273994, A273996, A273998.
%K nonn
%O 0,3
%A _Alois P. Heinz_, Jun 10 2018
|
