id:A058977 - OEIS Search Results

Search: id:A058977

Displaying 1-1 of 1 results found.

page 1

For a rational number p/q let f(p/q) = sum of distinct prime factors (A008472) of p+q divided by number of distinct prime factors (A001221) of p+q; a(n) is obtained by iterating f, starting at n/1, until an integer is reached, or if no integer is ever reached then a(n) = 0.

+0
6

2, 3, 2, 5, 7, 7, 2, 3, 3, 11, 7, 13, 11, 4, 2, 17, 7, 19, 3, 5, 4, 23, 7, 5, 17, 3, 11, 29, 13, 31, 2, 7, 5, 6, 7, 37, 23, 8, 3, 41, 4, 43, 4, 4, 3, 47, 7, 7, 3, 10, 17, 53, 7, 8, 11, 11, 7, 59, 13, 61, 6, 5, 2, 9, 19, 67, 5, 13, 17, 71, 7, 73, 41, 4, 23, 9, 6, 79, 3, 3, 4, 83, 4, 11, 47 (list; graph; listen)

	OFFSET	`1,1`
	LINKS	`Matthew M. Conroy, Home page (listed instead of email address)`
	EXAMPLE	`f(5/1) = 5/2 and f(5/2) = 7, so a(5)=7.`
	CROSSREFS	`Cf. A058971, A058972.` `Sequence in context: A025473 A092556 A092550 this_sequence A085818 A064939 A151549` `Adjacent sequences: A058974 A058975 A058976 this_sequence A058978 A058979 A058980`
	KEYWORD	`nonn,easy,nice`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Jan 14 2001`
	EXTENSIONS	`More terms from Matthew M. Conroy, Apr 18 2001`

page 1

Search completed in 0.004 seconds

Last modified November 24 14:25 EST 2009. Contains 167438 sequences.

AT&T Labs Research