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 A214132 #24 Feb 02 2020 07:55:27 %S A214132 6,135,14105,15506071,432712085377,1890948943,14783271043,45847, %T A214132 211838579,147560225903398137982300169126840969637180767467, %U A214132 12060713581457342807125295910808091355523729 %N A214132 Lesser 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 A214132 For n>2, instances are known up to 11 (p=31). %C A214132 By definition, gcd(a(n), A002110(n-1)) = 1. - _Michel Marcus_, Jan 19 2014 %H A214132 Achim Flammenkamp, <a href="http://wwwhomes.uni-bielefeld.de/achim/mpn.html">The Multiply Perfect Numbers Page</a> (for p = 13, 17, 19) %H A214132 Michel Marcus, <a href="/A214132/a214132.txt">Table A214132 and A214133 for n = 1..11</a> %e A214132 For n=1, the perfect numbers 6=2*3 and 28=2^2*7 (A214133) are primitive friendly. %e A214132 For n=2, 135=3^3*5 and 819=3^2*7*13 (A214133) are primitive friendly. %Y A214132 Cf. A214133. Subset of sequence A096366. %K A214132 hard,more,nonn %O A214132 1,1 %A A214132 _Michel Marcus_, Jul 05 2012