%I #16 Aug 07 2017 18:13:02
%S 1,1,1,2,2,1,5,5,3,1,16,16,10,4,1,61,61,39,17,5,1,272,272,176,80,26,6,
%T 1,1385,1385,903,421,145,37,7,1,7936,7936,5200,2464,880,240,50,8,1,
%U 50521,50521,33219,15917,5825,1661,371,65,9,1
%N Square array, read by antidiagonals, used to recursively calculate the zigzag numbers A000111.
%C The table entries T(n,k), for n,k>=1, are defined by means of the recurrence relation (1)... T(n+1,k) = 1/2*{(k-1)*T(n,k-1)+(k+1)*T(n,k+1)}, with boundary condition T(1,k) = 1.
%C The first column of the table produces the sequence of zigzag numbers A000111. Cf. A185416, A185418 and A185420.
%C Diagonal T(n,n+1) = A290579(n) for n>=1. - _Paul D. Hanna_, Aug 07 2017
%F (1)... T(n,k) = Z(n,k)/k with Z(n,x) the zigzag polynomials described in A147309.
%e The array begins:
%e 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ...;
%e 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, ...;
%e 2, 5, 10, 17, 26, 37, 50, 65, 82, ...;
%e 5, 16, 39, 80, 145, 240, 371, 544, 765, ...;
%e 16, 61, 176, 421, 880, 1661, 2896, 4741, 7376, ...;
%e 61, 272, 903, 2464, 5825, 12336, 23947, 43328, 73989, ...;
%e 272, 1385, 5200, 15917, 41936, 98377, 210320, 416765, ...;
%e 1385, 7936, 33219, 112640, 326965, 840960, 1962191, ...; ...
%e Examples of the recurrence:
%e T(4,4) = 80 = (3*T(3,3) + 5*T(3,5))/2 = (3*10 + 5*26)/2;
%e T(5,3) = 176 = (2*T(4,2) + 4*T(4,4))/2 = (2*16 + 4*80)/2;
%e T(6,2) = 272 = (1*T(5,1) + 3*T(5,3))/2 = (1*16 + 3*176)/2.
%p #A185414 Z := proc(n,x)
%p description 'zigzag polynomials A147309'
%p if n = 0 return 1 else return 1/2*x*(Z(n-1,x-1)+Z(n-1,x+1))
%p end proc:
%p # values of Z(n,x)/x
%p for n from 1 to 10 do seq(Z(n,k)/k, k = 1..10);
%p end do;
%o (PARI) {T(n,k)=if(n==1,1,((k-1)*T(n-1,k-1)+(k+1)*T(n-1,k+1))/2)}
%o for(n=1,10, for(k=1,10, print1(T(n,k),", ")); print(""))
%Y Cf. A000111, A147309, A185416, A185418, A185420, A290579.
%K nonn,easy,tabl
%O 1,4
%A _Peter Bala_, Jan 26 2011