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.

A061930 Square array read by antidiagonals of T(n,k)=T(n-1,[k/2])+T(n-1,[k/3]) with T(0,0)=1.

Original entry on oeis.org

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

Views

Author

Henry Bottomley, May 22 2001

Keywords

Examples

			T(9, 7) = T(8, [7/2])+T(8, [7/3]) = T(8, 3)+T(8, 2) = 256+256 = 512. Rows start (1, 0, 0, 0, 0, ...), (2, 2, 1, 0, 0, ...), (4, 4, 4, 4, 3, ...) etc.
		

Crossrefs

Row sums are 5^n, i.e. A000351. Each row starts with 2^n copies of 2^n, i.e. A000079 and then continues with A036561 copies of other terms in the rows of A055248. Cf. A061929.