Changes

|}

|}

Applying the same procedure to any positive integer <math>n\!</math> produces an expression called the ''doubly recursive factorization'' of <math>n.\!</math>  It serves to call this the ''drift'' of <math>n\!</math> and to notate the corresponding mapping from positive integers to factorization expressions as <math>\operatorname{drift}(n).\!</math>

Applying the same procedure to any positive integer <math>n\!</math> produces an expression called the ''doubly recursive factorization'' (DRF) of <math>n.\!</math>  This may be abbreviated as <math>\operatorname{drf}(n).\!</math>

 

The form of a DRF expression can be mapped into either one of two classes of graph-theoretical structures, called ''riffs'' and ''rotes'', respectively.

 

The ''riff'' of <math>123456789\!</math> is the following digraph:

{| align=center cellpadding="6"

{| align=center cellpadding="6"

|}

|}

<br>

The ''rote'' of <math>123456789\!</math> is the following graph:

{| align=center cellpadding="6"

{| align=center cellpadding="6"