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.

A141674 Triangle T(n,m) read by rows: T(n,m) = sigma_0(n) * A126988(n,m).

Original entry on oeis.org

1, 4, 2, 6, 0, 2, 12, 6, 0, 3, 10, 0, 0, 0, 2, 24, 12, 8, 0, 0, 4, 14, 0, 0, 0, 0, 0, 2, 32, 16, 0, 8, 0, 0, 0, 4, 27, 0, 9, 0, 0, 0, 0, 0, 3, 40, 20, 0, 0, 8, 0, 0, 0, 0, 4, 22, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 72, 36, 24, 18, 0, 12, 0, 0, 0, 0, 0, 6, 26, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 56, 28, 0, 0, 0, 0, 8, 0, 0, 0, 0, 0, 0, 4
Offset: 1

Views

Author

Roger L. Bagula and Gary W. Adamson, Sep 06 2008

Keywords

Comments

Row sums are {1, 6, 8, 21, 12, 48, 16, 60, 39, 72}.

Examples

			Triangle begins
  { 1},
  { 4,  2},
  { 6,  0,  2},
  {12,  6,  0,  3},
  {10,  0,  0,  0,  2},
  {24, 12,  8,  0,  0,  4},
  {14,  0,  0,  0,  0,  0,  2},
  {32, 16,  0,  8,  0,  0,  0,  4},
  {27,  0,  9,  0,  0,  0,  0,  0,  3},
  {40, 20,  0,  0,  8,  0,  0,  0,  0,  4}
		

Crossrefs

Cf. A126988.

Programs

  • Mathematica
    t[n_, m_] = DivisorSigma[0, n]*If[m == 1, n, If[Mod[n, m] == 0, n/m, 0]]; Table[Table[t[n, m], {m, 1, n}], {n, 1, 10}]; Flatten[%]

Formula

T(n,m) = sigma_0(n) * A126988(n,m).
T(n,m) = sigma_0(n) * if(m = 1, n, if(n mod m = 0, n/m, 0)).

Extensions

Edited by the Associate Editors of the OEIS, Jun 10 2018