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!)
 A214133 Greater term of smallest primitive friendly pair such that both terms are divisible by the n-th prime p and coprime to the primes below p. 2
 28, 819, 5397553488925, 155910789068784883, 468952332085139186546370744026318507437, 20936431529, 91765283361830966873857001143707378257, 17927087081, 1596235637603 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS By definition, GCD(a(n), A002110(n-1)) = 1. - Michel Marcus, Jan 19 2014 LINKS EXAMPLE For n=1, the perfect numbers 6=2*3 (A214132) and 28=2^2*7 are primitive friendly. For n=2, 135=3^3*5 (A214132) and 819=3^2*7*13 are primitive friendly. CROSSREFS Cf. A214132. Subset of sequence A096366. Sequence in context: A041365 A042514 A158659 * A119055 A324450 A326279 Adjacent sequences:  A214130 A214131 A214132 * A214134 A214135 A214136 KEYWORD nonn AUTHOR Michel Marcus, Jul 05 2012 EXTENSIONS a(7) corrected and a(8)-a(9) added by Michel Marcus, Jun 18 2016 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 September 28 13:24 EDT 2020. Contains 337393 sequences. (Running on oeis4.)