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 A263118 #15 Feb 16 2025 08:33:27
%S A263118 1,3,4,5,6,10,11,18,20,29,33,70,115,116,133,136,155,156,157,212,255,
%T A263118 360,414,468,470,477,518,519,578,771,787,830,971,1039,1046,1121,1687,
%U A263118 1793,2983,3092,3359,3360,3570,4084,4190,4255,5281,7032,7141,7167,8248,8385,8386,8630,8890
%N A263118 Indices of the primitive friendly pairs in the sequence of friendly pairs (A050973, A050972) ordered by smallest maximal element.
%C A263118 Friends x and y are primitive friendly if and only if they have no common prime factor with the same multiplicity, that is, if A165430(x, y) = 1.
%H A263118 Walter Nissen, <a href="http://upforthecount.com/math/mandrill.html">Primitive Friendly Integers and Exclusive Multiples</a>, Up for the Count!
%H A263118 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/FriendlyPair.html">Friendly Pair</a>.
%F A263118 A233039(n) = A050973(a(n)).
%e A263118 The first pair (6, 28) is primitive since 6=2*3 and 28=2^2*7; their only common prime factor, 2, appears with different exponents, so 1 is a term.
%e A263118 The second pair (30, 140) is not primitive since 30=5*6 and 140=5*28; the prime factor 5 appears in each with the same exponent, so 2 is not a term.
%o A263118 (PARI) udivs(n) = {my(d = divisors(n)); select(x->(gcd(x, n/x)==1), d);}
%o A263118 ugcd(x,y) = vecmax(setintersect(udivs(x), udivs(y)));
%o A263118 lista(vp, vg) = {for (n=1, #vp, if (ugcd(vp[n], vg[n])==1, print1(n, ", ")););} \\ where vp and vg are A050972 and A050973
%Y A263118 Cf. A050972, A050973, A165430, A233039.
%K A263118 nonn
%O A263118 1,2
%A A263118 _Michel Marcus_, Oct 10 2015