login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A074091
Number of steps to reach an integer starting with s = n/5 and iterating the map x -> s*ceiling(x).
1
4, 3, 5, 4, 0, 5, 3, 4, 5, 0, 4, 9, 2, 8, 0, 1, 1, 1, 1, 0, 7, 7, 4, 2, 0, 14, 2, 5, 7, 0, 4, 2, 9, 10, 0, 5, 8, 10, 2, 0, 1, 1, 1, 1, 0, 7, 2, 4, 17, 0, 2, 5, 2, 6, 0, 3, 17, 4, 6, 0, 2, 3, 6, 11, 0, 1, 1, 1, 1, 0, 11, 7, 2, 12, 0, 12, 6, 5, 3, 0, 2, 9, 3, 4, 0, 8, 2, 3, 6, 0, 1, 1, 1, 1, 0, 2, 6, 3, 3, 0, 10
OFFSET
6,1
CROSSREFS
Sequence in context: A328237 A249220 A075128 * A177033 A104569 A093619
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Sep 16 2002
STATUS
approved