cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A140648 Triangle T(n,m) which can create A140642 without help of Jacobsthal numbers.

Original entry on oeis.org

1, 2, 0, 4, 1, 0, 8, 2, 0, 1, 16, 4, 1, 0, 2, 32, 8, 2, 0, 1, 4, 64, 16, 4, 1, 0, 2, 8, 128, 32, 8, 2, 0, 1, 4, 16, 256, 64, 16, 4, 1, 0, 2, 8, 32, 512, 128, 32, 8, 2, 0, 1, 4, 16, 64
Offset: 0

Views

Author

Paul Curtz, Jul 09 2008

Keywords

Comments

This triangle T(.,.) provides the additional terms if A140642 is constructed with a Pascal-type recurrence: A140642(n+1,m+1) = A140642(n,m) + A140642(n,m+1) + T(n,m+1).
Note almost odd palindromes (of squares) followed by their double.
Examples: 40=16+20+4, 42=20+21+1, 43=21+22+0, 44=22+24+2.

Examples

			Triangle begins:
    1;
    2,  0;
    4,  1,  0;
    8,  2,  0,  1;
   16,  4,  1,  0,  2;
   32,  8,  2,  0,  1,  4;
   64, 16,  4,  1,  0,  2,  8;
  128, 32,  8,  2,  0,  1,  4, 16;
		

Crossrefs

Cf. A083329 (row sums).

Formula

Southeast diagonals based on A131577 (which is also in A140531). First preceded with 1, 0. Second with 2, 1, 0. Tends towards even palindromes, second part being A131577. Verticals: A000079, A131577, (0, A131577), ... .