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.

A382749 Position in block for greedy partition of length 4.

Original entry on oeis.org

1, 2, 3, 4, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 3, 2, 1, 3, 1, 4, 3, 2, 1, 4, 1, 2, 1, 4, 1, 1, 1, 1, 3, 2, 1, 1, 1, 2, 3, 1, 1, 1, 1, 4, 1, 2, 1, 1, 1, 2, 3, 4, 1, 2, 1, 1, 3, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 4, 3, 2, 1, 2, 1, 2, 3, 4, 1, 1, 1, 2, 3, 2, 1, 2, 1, 2, 3, 1, 1, 3, 1, 4, 3, 2, 1, 3, 1, 2, 1, 4
Offset: 1

Views

Author

Jan Snellman, Apr 24 2025

Keywords

Comments

a(n) = height of n with respect to the greedy convolution of length 4.
Position of n i block containing it for the greedy partition of length 4 of the positive integers.
a(n) = the column (one-indexed) in which n occurs in the infinite matrix A382747.

Crossrefs

a(n) = column index of the unique position in the infinite matrix A382747 in which n occurs.
a(n) = 1 iff n is "primitive" with respect to the greedy convolution of length 4 i.e. if n occurs in A382748.