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.

A356974 Irregular triangle T(n, k) read by rows, n >= 0, k = 1..A117546(n); the n-th row contains the numbers m such that A356964(m) = n, in increasing order.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 16, 15, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 32, 29, 33, 30, 34, 31, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 48, 47, 49, 50, 51, 52, 53, 54, 55, 56, 64, 57, 65, 58, 66, 59, 67, 60, 68, 61, 69, 62, 70
Offset: 0

Views

Author

Rémy Sigrist, Sep 07 2022

Keywords

Comments

This sequence is to tribonacci numbers (A000073) what A345101 is to Fibonacci numbers (A000045).
This sequence (when interpreted as a flat sequence) is a permutation of the nonnegative integers.

Examples

			Triangle begins:
     0   [0]
     1   [1]
     2   [2]
     3   [3]
     4   [4]
     5   [5]
     6   [6]
     7   [7, 8]
     8   [9]
     9   [10]
    10   [11]
    11   [12]
    12   [13]
    13   [14, 16]
    14   [15, 17]
		

Crossrefs

Programs

  • PARI
    See Links section.

Formula

T(n, 1) = A003796(n+1).
T(n, A117546(n)) = A003726(n+1).