id:A074078 - OEIS Search Results

Search: id:A074078

Displaying 1-1 of 1 results found.

page 1

Number of steps to reach an integer starting with s = n/3 and iterating the map x -> s*ceiling(x).

+0
9

0, 2, 4, 0, 1, 1, 0, 13, 2, 0, 3, 2, 0, 1, 1, 0, 2, 4, 0, 8, 5, 0, 1, 1, 0, 7, 9, 0, 2, 7, 0, 1, 1, 0, 3, 2, 0, 6, 2, 0, 1, 1, 0, 2, 3, 0, 10, 3, 0, 1, 1, 0, 3, 3, 0, 2, 3, 0, 1, 1, 0, 5, 2, 0, 5, 2, 0, 1, 1, 0, 2, 10, 0, 3, 7, 0, 1, 1, 0, 8, 4, 0, 2, 6, 0, 1, 1, 0, 5, 2, 0, 3, 2, 0, 1, 1, 0, 2, 5, 0, 4, 6, 0, 1, 1, 0 (list; graph; listen)

	OFFSET	`3,2`
	EXAMPLE	`s = 5/3 -> 10/3 -> 20/3 -> 35/3 -> 20, so a(5) = 4.`
	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, 3), n=4..120)];`
	CROSSREFS	`Cf. A072340, A074090, A074091, A074096. Records are in A074097, A074098.` `First integer reached: A081852.` `Sequence in context: A102561 A072068 A078145 this_sequence A130659 A083741 A118343` `Adjacent sequences: A074075 A074076 A074077 this_sequence A074079 A074080 A074081`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Sep 16 2002`

page 1

Search completed in 0.002 seconds

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.

AT&T Labs Research