%I A085476
%S A085476 1,1,1,1,1,1,1,2,1,1,1,3,1,1,1,1,4,3,1,1,1,1,5,6,1,2,1,1,1,6,10,4,1,1,
               1,
%T A085476 1,1,7,15,10,1,3,1,1,1,1,8,21,20,5,1,3,2,1,1,1,9,28,35,15,1,4,1,1,1,1,
               1,
%U A085476 10,36,56,35,6,1,6,1,1,1,1
%N A085476 Periodic Pascal array, read by antidiagonals.
%C A085476 G.f. of binomial transform of k-th row is given by 1/((1-x)^(k+1)-x^(k+1))
%F A085476 Square array T(n, k)=C(k, n mod (k+1)).
%e A085476 Rows begin
%e A085476 1 1 1 1 1 1 ...
%e A085476 1 1 1 1 1 1 ...
%e A085476 1 2 1 1 2 1 ...
%e A085476 1 3 3 1 1 3 ...
%e A085476 1 4 6 4 1 1 ...
%Y A085476 Cf. A007318, A000749, A049016, A006090, A049017.
%Y A085476 Sequence in context: A095025 A069897 A107682 this_sequence A124944 A094392 
               A111946
%Y A085476 Adjacent sequences: A085473 A085474 A085475 this_sequence A085477 A085478 
               A085479
%K A085476 easy,nonn,tabl
%O A085476 0,8
%A A085476 Paul Barry (pbarry(AT)wit.ie), Jul 02 2003