Category:Definitions/Pea Patterns

From ProofWiki
Jump to navigation Jump to search

This category contains definitions related to Pea Patterns.
Related results can be found in Category:Pea Patterns.


The first term $p_0$ is an arbitrary integer.

$p_n$ is formed from $p_{n - 1}$ as follows.

First, the distinct digits in $p_{n - 1}$ are counted, and the number of each is noted.

The count of each distinct digit is concatenated with an instance of the digit itself.

Then those concatenations are themselves concatenated into $p_n$ according to a predetermined order.