OFFSET
0,5
LINKS
E. Munarini, Characteristic, admittance and matching polynomials of an antiregular graph, Appl. Anal. Discrete Math. 3 (2009), 157-176.
FORMULA
T(n,k) = sum(|s(n+1,j+1)|*(-1)^(k-j-1)/(ceiling(n/2)^(k-j)),j=0..k-1),
where s(n,k) are the Stirling numbers of the first kind.
Recurrence: ceiling(n+1/2)*T(n+1,k+2) = ceiling(n/2)*(n+1)*T(n,k+2) + (n+1+ceiling(n/2))*T(n,k+1) + T(n,k) - T(n+1,k+1)
EXAMPLE
Triangle begins:
1
0, 1
0, 2, 1
0, 3, 4, 1
0, 12, 19, 8, 1
0, 40, 78, 49, 12, 1
0, 240, 508, 372, 121, 18, 1
0, 1260, 2952, 2545, 1056, 226, 24, 1
0, 10080, 24876, 23312, 10993, 2864, 418, 32, 1
MATHEMATICA
Flatten[Table[If[n==0&&k==0, 1, If[n==0&&k>0, 0, Sum[Abs[StirlingS1[n+1, j+1]](-1)^(k+j-1)/Ceiling[n/2]^(k-j), {j, 0, k-1}]]], {n, 0, 8}, {k, 0, n}], 1]
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Emanuele Munarini, Mar 26 2011
STATUS
approved