The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A085641 Smallest prime == 1 mod(p*q*...k) where p, q, ...k are all the distinct prime divisors of n. Or, smallest prime == 1 (mod the largest squarefree divisor of n). 1
 2, 3, 7, 3, 11, 7, 29, 3, 7, 11, 23, 7, 53, 29, 31, 3, 103, 7, 191, 11, 43, 23, 47, 7, 11, 53, 7, 29, 59, 31, 311, 3, 67, 103, 71, 7, 149, 191, 79, 11, 83, 43, 173, 23, 31, 47, 283, 7, 29, 11, 103, 53, 107, 7, 331, 29, 229, 59, 709, 31, 367, 311, 43, 3, 131, 67, 269, 103, 139 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 COMMENTS All the numbers having the same set of prime divisors are mapped to the same prime. LINKS FORMULA a(n) = A034694(A007947(n)). CROSSREFS Cf. A007947. Sequence in context: A160727 A187152 A086508 * A086516 A281962 A245675 Adjacent sequences:  A085638 A085639 A085640 * A085642 A085643 A085644 KEYWORD easy,nonn AUTHOR Amarnath Murthy, Jason Earls, Jul 11 2003 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 26 08:06 EDT 2020. Contains 338027 sequences. (Running on oeis4.)