The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A140946 Triangle T(n,k) = (-2)^n*(-1)^k if k
 1, -2, -1, 4, -4, 3, -8, 8, -8, -5, 16, -16, 16, -16, 11, -32, 32, -32, 32, -32, -21, 64, -64, 64, -64, 64, -64, 43, -128, 128, -128, 128, -128, 128, -128, -85, 256, -256, 256, -256, 256, -256, 256, -256, 171, -512, 512, -512, 512, -512, 512, -512, 512, -512, -341, 1024, -1024, 1024, -1024, 1024 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS The sequence appears if the values b(n+1)-2*b(n) are computed from the (flattened) sequence b(.)=A140944. Reading the triangle by rows, taking absolute values and removing duplicates we obtain A112387. LINKS Table of n, a(n) for n=0..59. FORMULA T(n,k) = A140944(n,k+1)-2*A140944(n,k), k

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

Last modified July 21 09:38 EDT 2024. Contains 374472 sequences. (Running on oeis4.)