cp's OEIS Frontend

A059235 The array in A059219 read by antidiagonals in the direction in which it was constructed.

%I A059235 #11 Jan 03 2017 02:39:56
%S A059235 1,0,1,0,1,2,0,2,3,5,0,5,8,12,15,0,15,27,39,48,55,0,55,103,152,190,
%T A059235 221,239,0,239,460,680,871,1025,1137,1199,0,1199,2336,3471,4493,5374,
%U A059235 6062,6553,6810,0,6810,13363,19903,25958,31351,35884,39399,41847,43108,0
%N A059235 The array in A059219 read by antidiagonals in the direction in which it was constructed.
%H A059235 G. C. Greubel, <a href="/A059235/b059235.txt">Table of n, a(n) for the first 50 rows, flattened</a>
%H A059235 <a href="/index/Bo#boustrophedon">Index entries for sequences related to boustrophedon transform</a>
%e A059235 The array begins
%e A059235 1 1 0 5 0 55 0 ...
%e A059235 0 1 3 5 48 55 ...
%e A059235 2 2 8 39 103 ...
%e A059235 0 12 27 152 ...
%e A059235 15 15 190 ...
%e A059235 0 221 ...
%t A059235 max = 10; t[0, 0] = 1; t[0, _?EvenQ] = 0; t[_?OddQ, 0] = 0; t[n_, k_] /; OddQ[n+k](*up*):= t[n, k] = t[n+1, k-1] + Sum[t[n, j], {j, 0, k-1}]; t[n_, k_] /; EvenQ[n+k](*down*):= t[n, k] = t[n-1, k+1] + Sum[t[j, k], {j, 0, n-1}]; Table[tn = Table[t[n-k, k], {k, 0, n}]; If[OddQ[n], tn, tn // Reverse] , {n, 0, max}] // Flatten (* _Jean-François Alcover_, Nov 20 2012 *)
%Y A059235 Cf. A000667, A059216, A059219, A059217, A059220.
%K A059235 easy,nonn,tabl,nice
%O A059235 1,6
%A A059235 _N. J. A. Sloane_, Jan 18 2001
%E A059235 More terms from Larry Reeves (larryr(AT)acm.org), Jan 24 2001