id:A060409 - OEIS Search Results

Search: id:A060409

Displaying 1-1 of 1 results found.

page 1

In the `3x+1' problem, take the sequence of starting values which set new records for the highest point of the trajectory before reaching 1 (A006884); sequence gives associated "dropping time", number of steps to reach a lower value than the start.

+0
4

1, 4, 7, 7, 59, 13, 40, 23, 81, 61, 70, 65, 54, 72, 65, 59, 127, 105, 110, 59, 72, 164, 140, 73, 170, 105, 149, 97, 135, 183, 99, 99, 124, 156, 200, 140, 222, 264, 181, 243, 203, 238, 262, 362, 249, 183, 238, 226, 243, 294, 375, 455, 292, 245, 414 (list; graph; listen)

	OFFSET	`1,2`
	LINKS	`N. J. A. Sloane, Table of n, a(n) for n=1..88 (from the web page of Tomas Oliveira e Silva)` `Tomas Oliveira e Silva, Tables (gives many more terms)` `Index entries for sequences related to 3x+1 (or Collatz) problem`
	CROSSREFS	`Cf. A006884, A060410, A060411.` `Sequence in context: A063194 A071529 A154922 this_sequence A151968 A115632 A151958` `Adjacent sequences: A060406 A060407 A060408 this_sequence A060410 A060411 A060412`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Apr 06 2001; b-file added Nov 27 2007`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research