id:A075660 - OEIS Search Results

Search: id:A075660

Displaying 1-1 of 1 results found.

page 1

Let f(n) = abs(lpd(n)-Lpf(n)), where lpd(n) is the largest proper divisor of n and Lpf(n) is the largest prime factor of n. Sequence gives number of iterations for f(n) to reach zero.

+0
3

1, 2, 3, 1, 2, 1, 2, 3, 1, 1, 2, 4, 5, 1, 1, 2, 3, 2, 3, 3, 1, 1, 2, 2, 1, 1, 2, 3, 4, 2, 3, 2, 1, 1, 1, 2, 3, 1, 1, 2, 3, 2, 3, 3, 2, 1, 2, 2, 1, 4, 1, 6, 7, 3, 1, 2, 1, 1, 2, 2, 3, 1, 2, 3, 1, 2, 3, 4, 1, 4, 5, 2, 3, 1, 4, 4, 1, 2, 3, 2, 3, 1, 2, 2, 1, 1, 1, 2, 3, 3, 1, 3, 1, 1, 1, 3, 4, 3, 2, 3 (list; graph; listen)

	OFFSET	`1,2`
	EXAMPLE	`a(12)=4 because 12 -> 3 -> 2 -> 1 -> 0.`
	CROSSREFS	`Adjacent sequences: A075657 A075658 A075659 this_sequence A075661 A075662 A075663` `Sequence in context: A106038 A078711 A076423 this_sequence A073058 A100336 A006376`
	KEYWORD	`nonn`
	AUTHOR	`Jason Earls (zevi_35711(AT)yahoo.com), Sep 23 2002`

page 1

Search completed in 0.002 seconds

Last modified October 13 20:18 EDT 2008. Contains 145016 sequences.

AT&T Labs Research