Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #12 Jan 17 2013 09:17:23
%S 1,0,1,2,0,2,3,12,0,6,28,24,72,0,24,125,400,180,480,0,120,1146,2220,
%T 4680,1440,3600,0,720,8827,29064,30870,53760,12600,30240,0,5040,94200,
%U 272272,545328,409920,638400,120960,282240,0,40320,1007001,3722688,5989032,9386496,5518800,7983360,1270080,2903040,0,362880
%N Triangular array read by rows. T(n,k) is the number of functional digraphs on {1,2,...,n} such that no node is at a distance greater than one from a cycle and there are k recurrent elements whose preimage contains only one element, n>=0, 0<=k<=n.
%C Row sums = A006153. Column for k=0 is A052848.
%F E.g.f.: 1/(1 - x*(exp(x) -1 + y)).
%e 1,
%e 0, 1,
%e 2, 0, 2,
%e 3, 12, 0, 6,
%e 28, 24, 72, 0, 24,
%e 125, 400, 180, 480, 0, 120, 0
%e 1146, 2220, 4680, 1440, 3600, 0, 720
%t nn=6;a=x Exp[x];Range[0,nn]!CoefficientList[Series[1/(1-x (Exp[x]-1+y)),{x,0,nn}],{x,y}]//Grid
%Y Cf. A006153.
%K nonn,tabl
%O 0,4
%A _Geoffrey Critzer_, Dec 07 2012