id:A102419 - OEIS Search Results

Search: id:A102419

Displaying 1-1 of 1 results found.

page 1

"Dropping time" in 3x+1 problem starting at n (number of steps to reach a lower number than starting value); a(1) = 0 by convention.

+0
3

0, 1, 6, 1, 3, 1, 11, 1, 3, 1, 8, 1, 3, 1, 11, 1, 3, 1, 6, 1, 3, 1, 8, 1, 3, 1, 96, 1, 3, 1, 91, 1, 3, 1, 6, 1, 3, 1, 13, 1, 3, 1, 8, 1, 3, 1, 88, 1, 3, 1, 6, 1, 3, 1, 8, 1, 3, 1, 11, 1, 3, 1, 88, 1, 3, 1, 6, 1, 3, 1, 83, 1, 3, 1, 8, 1, 3, 1, 13, 1, 3, 1, 6, 1, 3, 1, 8, 1, 3, 1, 73, 1, 3, 1, 13, 1, 3, 1, 6 (list; graph; listen)

	OFFSET	`1,3`
	CROSSREFS	`a(2n+1) = A060445(n). a(n) = A074473(n)-1 for n>1.` `Sequence in context: A082730 A010136 A087256 this_sequence A074193 A074453 A069608` `Adjacent sequences: A102416 A102417 A102418 this_sequence A102420 A102421 A102422`
	KEYWORD	`nonn`
	AUTHOR	`njas, Sep 15 2006`

page 1

Search completed in 0.002 seconds

Last modified September 8 08:06 EDT 2008. Contains 143486 sequences.

AT&T Labs Research