|
| |
|
|
A038571
|
|
Number of times n must be differentiated to reach 0.
|
|
3
| |
|
|
0, 1, 2, 1, 3, 2, 2, 1, 4, 3, 2, 3, 3, 2, 2, 1, 5, 4, 4, 3, 3, 2, 3, 4, 4, 3, 2, 3, 3, 2, 2, 1, 6, 5, 4, 5, 4, 5, 3, 4, 4, 3, 2, 3, 3, 4, 4, 5, 5, 4, 4, 3, 3, 2, 3, 4, 4, 3, 2, 3, 3, 2, 2, 1, 7, 6, 6, 5, 4, 5, 6, 5, 4, 5, 6, 5, 3, 4, 4, 5, 5, 4, 4, 3, 3, 2, 3, 4, 4, 3, 5, 4, 5, 4, 5, 6, 6, 5, 4, 5, 4, 5, 3, 4, 4
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
MATHEMATICA
| dtn[ L_ ] := Fold[ 2#1+#2&, 0, L ]; f[ n_ ] := dtn[ Map[ Abs[ #[ [ 1 ] ]-#[ [ 2 ] ] ]&, Partition[ IntegerDigits[ n, 2 ], 2, 1 ] ] ]; g[ n_ ] := Length[ FixedPointList[ f, n ] ]-2; Table[ g[ n ], {n, 0, 120} ]
|
|
|
CROSSREFS
| Cf. A038554.
Sequence in context: A157810 A072339 A175548 * A008687 A080801 A124758
Adjacent sequences: A038568 A038569 A038570 * A038572 A038573 A038574
|
|
|
KEYWORD
| nonn,easy,nice
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
EXTENSIONS
| More terms from Erich Friedman (erich.friedman(AT)stetson.edu)
|
| |
|
|
