id:A074090 - OEIS Search Results

Search: id:A074090

Displaying 1-1 of 1 results found.

page 1

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

+0
2

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; listen)

	OFFSET	`5,1`
	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: A145738 A095199 A074735 this_sequence A054025 A054869 A056931` `Adjacent sequences: A074087 A074088 A074089 this_sequence A074091 A074092 A074093`
	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 December 15 00:47 EST 2009. Contains 170825 sequences.

AT&T Labs Research