%I #10 Sep 11 2018 03:03:58
%S 1,0,1,1,0,1,1,1,0,1,0,1,1,0,1,1,0,1,1,0,1,1,1,0,1,1,0,1,0,1,1,0,1,1,
%T 0,1,1,0,1,1,0,1,1,0,1,1,1,0,1,1,0,1,1,0,1,0,1,1,0,1,1,0,1,1,0,1,1,0,
%U 1,1,0,1,1,0,1,1,0,1,1,1,0,1,1,0,1,1,0,1,1,0,1
%N Riordan array ((1+x^2)/(1-x^3),x).
%C Sequence array for the sequence F(L((n+2)/3)). Row sums are A093878. Diagonal sums are A051275. Inverse is A117568.
%D Murat Sahin and Elif Tan, Conditional (strong) divisibility sequences, Fib. Q., 56 (No. 1, 2018), 18-31.
%H D. Panario, M. Sahin, Q. Wang, <a href="http://www.emis.de/journals/INTEGERS/papers/n78/n78.Abstract.html">A family of Fibonacci-like conditional sequences</a>, INTEGERS, Vol. 13, 2013, #A78.
%F Number triangle T(n,k)=F(L((n-k+2)/3))[k<=n] where L(j/p) is the Legendre symbol of j and p.
%e Triangle begins
%e 1,
%e 0, 1,
%e 1, 0, 1,
%e 1, 1, 0, 1,
%e 0, 1, 1, 0, 1,
%e 1, 0, 1, 1, 0, 1,
%e 1, 1, 0, 1, 1, 0, 1,
%e 0, 1, 1, 0, 1, 1, 0, 1,
%e 1, 0, 1, 1, 0, 1, 1, 0, 1,
%e 1, 1, 0, 1, 1, 0, 1, 1, 0, 1
%K easy,nonn,tabl
%O 0,1
%A _Paul Barry_, Mar 29 2006
|