id:A060415 - OEIS Search Results

Search: id:A060415

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 "dropping time" (A060412); sequence gives associated iterate where maximal value is reached in the trajectory with that start.

+0
4

0, 2, 3, 45, 48, 20, 78, 124, 95, 103, 62, 147, 186, 36, 168, 65, 60, 179, 41, 146, 254, 254, 319, 346, 423, 166, 297, 206, 223, 164, 659, 607, 840, 808, 512 (list; graph; listen)

	OFFSET	`1,2`
	LINKS	`N. J. A. Sloane, Table of n, a(n) for n=1..35 (from the web page of Tomas Oliveira e Silva)` `Tomas Oliveira e Silva, Tables` `Index entries for sequences related to 3x+1 (or Collatz) problem`
	CROSSREFS	`Cf. A060412, A060413, A060414.` `Sequence in context: A100015 A042819 A100443 this_sequence A097929 A041501 A144420` `Adjacent sequences: A060412 A060413 A060414 this_sequence A060416 A060417 A060418`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Apr 06 2001; b-file added Nov 27 2007`
	EXTENSIONS	`Corrected by Don Reble (djr(AT)nk.ca), May 13 2006`

page 1

Search completed in 0.002 seconds

Last modified November 25 08:46 EST 2009. Contains 167481 sequences.

AT&T Labs Research