The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A117567 Riordan array ((1+x^2)/(1-x^3),x). 2
 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, 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, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS Sequence array for the sequence F(L((n+2)/3)). Row sums are A093878. Diagonal sums are A051275. Inverse is A117568. REFERENCES Murat Sahin and Elif Tan, Conditional (strong) divisibility sequences, Fib. Q., 56 (No. 1, 2018), 18-31. LINKS D. Panario, M. Sahin, Q. Wang, A family of Fibonacci-like conditional sequences, INTEGERS, Vol. 13, 2013, #A78. FORMULA 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. EXAMPLE Triangle begins 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, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1 CROSSREFS Sequence in context: A127245 A175192 A088150 * A307183 A117568 A093521 Adjacent sequences:  A117564 A117565 A117566 * A117568 A117569 A117570 KEYWORD easy,nonn,tabl AUTHOR Paul Barry, Mar 29 2006 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 28 10:02 EST 2020. Contains 331319 sequences. (Running on oeis4.)