id:A074091 - OEIS Search Results

Search: id:A074091

Displaying 1-1 of 1 results found.

page 1

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

+0
2

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 (list; graph; listen)

	OFFSET	`6,1`
	CROSSREFS	`Cf. A072340, A074078.` `Sequence in context: A131911 A011206 A075128 this_sequence A104569 A093619 A134186` `Adjacent sequences: A074088 A074089 A074090 this_sequence A074092 A074093 A074094`
	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 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research