

A262303


Length of sequence of lower halves of n: repeatedly apply x>floor(x/2) starting at n; a(n) = number of steps until reach one of 2,3,4.


1



0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

2,9


LINKS

Table of n, a(n) for n=2..88.
S. Jablan, L. H. Kauffman, and P. Lopes, The delunification process and minimal diagrams, arXiv:1406.2378 [math.GT], 2014.
S. Jablan, L. H. Kauffman, and P. Lopes, The delunification process and minimal diagrams, Topology Appl., 193 (2015), 270289, #5531.


EXAMPLE

20>10>5>2 takes 3 steps, so a(20)=3.


CROSSREFS

Cf. A262304.
Sequence in context: A085576 A108622 A112348 * A127321 A111897 A185711
Adjacent sequences: A262300 A262301 A262302 * A262304 A262305 A262306


KEYWORD

nonn,easy


AUTHOR

N. J. A. Sloane, Sep 30 2015


EXTENSIONS

a(31)a(88) from Hiroaki Yamanouchi, Oct 03 2015


STATUS

approved



