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 A070647 #23 Oct 28 2024 09:36:02
%S A070647 3,5,7,5,7,11,13,11,17,7,19,13,23,17,11,19,29,31,13,23,37,11,41,17,43,
%T A070647 29,13,31,47,19,53,37,23,59,17,61,41,43,19,67,47,71,13,29,73,31,79,53,
%U A070647 23,83,59,89,61,37,17,97,67,101,29,41,103,19,71,107,43,31,109,73,17
%N A070647 Largest prime factor of sequence of numbers of the form p*q (p, q distinct primes).
%H A070647 Reinhard Zumkeller, <a href="/A070647/b070647.txt">Table of n, a(n) for n = 1..10000</a>
%F A070647 a(n) = P(A006881(n)) where P(x) = A006530(x) is the largest prime factor of x.
%F A070647 a(n) = A006881(n)/A096916(n). - _Amiram Eldar_, Oct 28 2024
%e A070647 6 = 2*3 is the first number of the form p*q (p, q distinct primes) hence a(1) = 3.
%t A070647 f[n_]:=Last/@FactorInteger[n]=={1,1};f1[n_]:=Min[First/@FactorInteger[n]];f2[n_]:=Max[First/@FactorInteger[n]];lst={};Do[If[f[n],AppendTo[lst,f2[n]]],{n,0,6!}];lst (* _Vladimir Joseph Stephan Orlovsky_, Apr 10 2010 *)
%o A070647 (Haskell)
%o A070647 a070647 = a006530 . a006881 -- _Reinhard Zumkeller_, Sep 23 2011
%o A070647 (PARI) go(x)=my(v=List()); forprime(p=2, sqrtint(x\1), forprime(q=p+1, x\p, listput(v, [p*q,q]))); apply(v->v[2], vecsort(Vec(v),1)) \\ _Charles R Greathouse IV_, Sep 14 2015
%Y A070647 Cf. A006530, A006881, A084127, A096916, A195758.
%K A070647 easy,nonn
%O A070647 1,1
%A A070647 _Benoit Cloitre_, May 13 2002