login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A074090 Number of steps to reach an integer starting with s = n/4 and iterating the map x -> s*ceiling(x). 1
3, 1, 2, 0, 3, 2, 13, 0, 1, 1, 1, 0, 4, 3, 2, 0, 2, 1, 9, 0, 2, 2, 2, 0, 1, 1, 1, 0, 7, 4, 3, 0, 7, 1, 3, 0, 4, 2, 3, 0, 1, 1, 1, 0, 2, 3, 4, 0, 5, 1, 10, 0, 5, 2, 13, 0, 1, 1, 1, 0, 14, 5, 8, 0, 5, 1, 2, 0, 10, 2, 11, 0, 1, 1, 1, 0, 6, 3, 2, 0, 2, 1, 17, 0, 2, 2, 2, 0, 1, 1, 1, 0, 3, 4, 6, 0, 16, 1, 5, 0, 3, 2, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET

5,1

LINKS

Table of n, a(n) for n=5..107.

MAPLE

f := proc(b1, b2) local c1, c2, t1, t2, t3, t4, i; c1 := numer(b1/b2); c2 := denom(b1/b2); i := 0; while c2 <> 1 do i := i+1; t1 := ceil(c1/c2); t2 := b1*t1; t3 := t2/b2; c1 := numer(t3); c2 := denom(t3); od: RETURN(i); end; [seq(f(n, 4), n=5..120)];

CROSSREFS

Cf. A072340, A074078.

Sequence in context: A176107 A190561 A074735 * A054025 A265910 A222212

Adjacent sequences:  A074087 A074088 A074089 * A074091 A074092 A074093

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Sep 16 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 26 06:55 EDT 2019. Contains 321481 sequences. (Running on oeis4.)