Changes

|}

|}

Applying the same procedure to a positive integer <math>n</math> produces an expression called the ''doubly recursive factorization'' (DRF) or ''drift'' of <math>n.</math>

Applying the same procedure to any positive integer <math>n</math> produces an expression called the ''doubly recursive factorization'' of <math>n</math> and notated as <math>\operatorname{drf}(n).</math>

{| align=center cellpadding="6"

{| align=center cellpadding="6"