This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A127872 Triangle formed by reading A039599 mod 2. 8
 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS Also triangle formed by reading triangles A061554, A106180, A110519, A124574, A124576, A126953, A127543 modulo 2. LINKS G. C. Greubel, Table of n, a(n) for the first 50 rows, flattened FORMULA Sum_{k, 0<=k<=n}T(n,k)*x^k = A000007(n), A036987(n), A001316(n), A062878(n) for n=-1,0,1,2 respectively. Sum_{k, 0<=k<=n}T(n,k)*Fibonacci(2*k+1)=A050614(n), see A000045 and A001519. - Philippe Deléham, Aug 30 2007 EXAMPLE Triangle begins: 1; 1, 1; 0, 1, 1; 1, 1, 1, 1; 0, 0, 0, 1, 1; 0, 0, 1, 1, 1, 1; 0, 1, 1, 0, 0, 1, 1; 1, 1, 1, 1, 1, 1, 1, 1; 0, 0, 0, 0, 0, 0, 0, 1, 1; 0, 0, 0, 0, 0, 0, 1, 1, 1, 1; 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1; 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1; 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1; 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1; 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1; 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1; ... MATHEMATICA T[0, 0] := 1; T[n_, k_] := Binomial[2*n - 1, n - k] - Binomial[2*n - 1, n - k - 2]; Table[Mod[T[n, k], 2], {n, 0, 10}, {k, 0, n}] // Flatten (* G. C. Greubel, Apr 18 2017 *) CROSSREFS Sequence in context: A175087 A318924 A253414 * A129564 A317193 A293163 Adjacent sequences:  A127869 A127870 A127871 * A127873 A127874 A127875 KEYWORD nonn,tabl AUTHOR Philippe Deléham, Apr 05 2007 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 22 07:45 EST 2019. Contains 319353 sequences. (Running on oeis4.)