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.

A357120 Irregular triangle T(n, k), n > 0, k = 1..A278043(n); the n-th row contains, in ascending order, the terms in the greedy tribonacci representation of n.

Original entry on oeis.org

1, 2, 1, 2, 4, 1, 4, 2, 4, 7, 1, 7, 2, 7, 1, 2, 7, 4, 7, 1, 4, 7, 13, 1, 13, 2, 13, 1, 2, 13, 4, 13, 1, 4, 13, 2, 4, 13, 7, 13, 1, 7, 13, 2, 7, 13, 1, 2, 7, 13, 24, 1, 24, 2, 24, 1, 2, 24, 4, 24, 1, 4, 24, 2, 4, 24, 7, 24, 1, 7, 24, 2, 7, 24, 1, 2, 7, 24, 4, 7, 24
Offset: 1

Views

Author

Rémy Sigrist, Sep 12 2022

Keywords

Comments

See A357121 for the sequence corresponding to lazy tribonacci representations.

Examples

			Triangle T(n, k) begins:
     1: [1]
     2: [2]
     3: [1, 2]
     4: [4]
     5: [1, 4]
     6: [2, 4]
     7: [7]
     8: [1, 7]
     9: [2, 7]
    10: [1, 2, 7]
    11: [4, 7]
    12: [1, 4, 7]
    13: [13]
    14: [1, 13]
    15: [2, 13]
		

Crossrefs

Programs

  • PARI
    See Links section.

Formula

T(n, 1) = A275392(n).
Sum_{k = 1..A278043(n)} T(n, k) = n.