login
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.
2
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,2
COMMENTS
See A357121 for the sequence corresponding to lazy tribonacci representations.
FORMULA
T(n, 1) = A275392(n).
Sum_{k = 1..A278043(n)} T(n, k) = n.
EXAMPLE
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]
PROG
(PARI) See Links section.
KEYWORD
nonn,tabf
AUTHOR
Rémy Sigrist, Sep 12 2022
STATUS
approved