|
%I #15 Jun 10 2018 16:16:09
%S 1,1,4,27,250,2975,43296,744913,14797036,333393345,8403026320,
%T 234300271811,7161316358616,238108166195263,8556626831402560,
%U 330494399041444425,13654219915946513296,600870384794864432897,28060233470995898505024,1386000542545570348128235
%N Number of endofunctions on [n] whose cycle lengths are Fibonacci numbers.
%H Alois P. Heinz, <a href="/A273994/b273994.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:= r+(f-1)!*b(n-f)*
%p binomial(n-1, f-1); f, g:= g, f+g
%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 = r + (f - 1)!*b[n - f]*Binomial[n - 1, f - 1]; {f, g} = {g, f + g}]; 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 06 2018, from Maple *)
%Y Cf. A000045, A060435, A116956, A273001, A273996, A273997, A273998, A305824.
%K nonn
%O 0,3
%A _Alois P. Heinz_, Jun 06 2016
|
