id:A060412 - OEIS Search Results

Search: id:A060412

Displaying 1-1 of 1 results found.

page 1

In the `3x+1' problem, these values for the starting value set new records for the "dropping time", number of steps to reach a lower value than the start.

+0
6

2, 3, 7, 27, 703, 10087, 35655, 270271, 362343, 381727, 626331, 1027431, 1126015, 8088063, 13421671, 20638335, 26716671, 56924955, 63728127, 217740015, 1200991791, 1827397567, 2788008987, 12235060455 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`The (3x+1)/2 steps and the halving steps are counted. - Don Reble djr(AT)nk.ca, May 13 2006`
	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 (gives many more terms)` `Index entries for sequences related to 3x+1 (or Collatz) problem`
	CROSSREFS	`A060413 gives associated "dropping times", A060414 the maximal values and A060415 the steps at which the maxima occur. Cf. A060445.` `Sequence in context: A128001 A052877 A137075 this_sequence A062573 A019435 A061092` `Adjacent sequences: A060409 A060410 A060411 this_sequence A060413 A060414 A060415`
	KEYWORD	`nonn`
	AUTHOR	`njas, Apr 06 2001; b-file added Nov 27 2007`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research