This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A214133 #14 Jun 18 2016 14:22:01 %S A214133 28,819,5397553488925,155910789068784883, %T A214133 468952332085139186546370744026318507437,20936431529, %U A214133 91765283361830966873857001143707378257,17927087081,1596235637603 %N 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. %C A214133 By definition, GCD(a(n), A002110(n-1)) = 1. - _Michel Marcus_, Jan 19 2014 %e A214133 For n=1, the perfect numbers 6=2*3 (A214132) and 28=2^2*7 are primitive friendly. %e A214133 For n=2, 135=3^3*5 (A214132) and 819=3^2*7*13 are primitive friendly. %Y A214133 Cf. A214132. Subset of sequence A096366. %K A214133 nonn %O A214133 1,1 %A A214133 _Michel Marcus_, Jul 05 2012 %E A214133 a(7) corrected and a(8)-a(9) added by _Michel Marcus_, Jun 18 2016