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.

Showing 1-1 of 1 results.

A348135 Irregular triangle T(n, k), n > 0, k = 1..A067399(n), read by rows; the n-th row gives, in ascending order, the distinct integers k such that A067138(k, m) = n for some m.

Original entry on oeis.org

1, 1, 2, 1, 3, 1, 2, 4, 1, 5, 1, 2, 3, 6, 1, 3, 7, 1, 2, 4, 8, 1, 9, 1, 2, 5, 10, 1, 11, 1, 2, 3, 4, 6, 12, 1, 13, 1, 2, 3, 6, 7, 14, 1, 3, 5, 7, 15, 1, 2, 4, 8, 16, 1, 17, 1, 2, 9, 18, 1, 19, 1, 2, 4, 5, 10, 20, 1, 5, 21, 1, 2, 11, 22, 1, 23, 1, 2, 3, 4, 6, 8, 12, 24
Offset: 1

Views

Author

Rémy Sigrist, Oct 02 2021

Keywords

Comments

The n-th row corresponds to the divisors of n in OR-numbral arithmetic.

Examples

			The triangle starts:
      1:   [1]
      2:   [1, 2]
      3:   [1, 3]
      4:   [1, 2, 4]
      5:   [1, 5]
      6:   [1, 2, 3, 6]
      7:   [1, 3, 7]
      8:   [1, 2, 4, 8]
      9:   [1, 9]
     10:   [1, 2, 5, 10]
     11:   [1, 11]
     12:   [1, 2, 3, 4, 6, 12]
     13:   [1, 13]
     14:   [1, 2, 3, 6, 7, 14]
     15:   [1, 3, 5, 7, 15]
     16:   [1, 2, 4, 8, 16]
		

Crossrefs

Programs

  • PARI
    See Links section.

Formula

T(n, 1) = 1.
T(n, A067399(n)) = n.
Showing 1-1 of 1 results.