A262304 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A262304

Tail of sequence of lower halves of n: repeatedly apply x->floor(x/2) starting at n until reach one of 2,3,4; a(n) = whichever of 2,3,4 is reached.

2

2, 3, 4, 2, 3, 3, 4, 4, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2

(list; graph; refs; listen; history; text; internal format)

OFFSET

2,1

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), 270-289, #5531.

EXAMPLE

20->10->5->2 takes 3 steps and ends at 2, so a(20)=2.

CROSSREFS

Sequence in context: A274917 A302795 A272726 * A333609 A273149 A151925

Adjacent sequences: A262301 A262302 A262303 * A262305 A262306 A262307

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane, Sep 30 2015

EXTENSIONS

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

STATUS

approved