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.

A122760 Triangle read by rows: t(n,m) = 2*3^m*(n mod 2).

Original entry on oeis.org

0, 2, 6, 0, 0, 0, 2, 6, 18, 54, 0, 0, 0, 0, 0, 2, 6, 18, 54, 162, 486, 0, 0, 0, 0, 0, 0, 0, 2, 6, 18, 54, 162, 486, 1458, 4374, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 6, 18, 54, 162, 486, 1458, 4374, 13122, 39366, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
Offset: 1

Views

Author

Roger L. Bagula, Sep 21 2006

Keywords

Comments

A Cantor-based power of 3 triangular array.

Examples

			0
2, 6
0, 0, 0
2, 6, 18, 54
0, 0, 0, 0, 0
2, 6, 18, 54, 162, 486
0, 0, 0, 0, 0, 0, 0
2, 6, 18, 54, 162, 486, 1458, 4374
		

References

  • Lynn Arthur Steen and J. Arthur Seebach, Jr., Counterexamples in Topology, Dover, New York, 1978, 57-58

Crossrefs

Row sums: see A024101.

Programs

  • Mathematica
    b[n_] := 2*Mod[n, 2] T2[n_, m_] := 3^n*b[m] b0 = Table[Table[T2[n, m], {n, 0, m}], {m, 0, 10}]; Flatten[b0] MatrixForm[b0]

Extensions

Edited and corrected by N. J. A. Sloane, May 29 2009