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.

A124735 Table with all sequences of nonnegative integers sorted first by total plus length, then by length and finally lexicographically.

Original entry on oeis.org

0, 1, 0, 0, 2, 0, 1, 1, 0, 0, 0, 0, 3, 0, 2, 1, 1, 2, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 4, 0, 3, 1, 2, 2, 1, 3, 0, 0, 0, 2, 0, 1, 1, 0, 2, 0, 1, 0, 1, 1, 1, 0, 2, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 5, 0, 4, 1, 3, 2, 2, 3, 1, 4, 0, 0, 0, 3, 0, 1, 2, 0, 2, 1, 0, 3, 0, 1, 0
Offset: 1

Views

Author

Keywords

Comments

This can be regarded as a table in two ways: with each weak composition as a row, or with the weak compositions of each integer as a row. The first way has A124736 as row lengths and A124748 as row sums; the second has A001792 as row lengths and A001787 as row sums.
This sequence includes every finite sequence of nonnegative integers.

Examples

			The table starts:
0
1; 0 0
2; 0 1; 1 0; 0 0 0
		

Crossrefs

Formula

a(n) = A124734(n) - 1.