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 A071145 #15 Jan 10 2025 10:07:55
%S A071145 72930,106590,190190,222870,335478,397670,620310,836418,844305,884442,
%T A071145 1008678,1195670,1218945,1247290,1704794,1761110,1799798,2086238,
%U A071145 2206022,2328410,2485830,2496585,2517258,2863718,2903538,3024021,3157665,3172785,3291890
%N A071145 Numbers n such that sum of distinct primes dividing n is divisible by the largest prime dividing n. Also n has exactly 6 distinct prime factors and n is squarefree.
%H A071145 Donovan Johnson, <a href="/A071145/b071145.txt">Table of n, a(n) for n = 1..1000</a>
%F A071145 A008472(n)/A006530(n) is an integer; A001221(n) = 6, n is squarefree.
%e A071145 n = pqrstw, p<q<r<s<t<w, primes, p+q+r+s+t+w = kt; n = 106590 = 2*3*5*11*17*19; sum = 2+3+5+11+17+19 = 57 = 3*19 (quotient=3) (Corrected Mar 06 2006.)
%t A071145 ffi[x_] := Flatten[FactorInteger[x]] lf[x_] := Length[FactorInteger[x]] ba[x_] := Table[Part[ffi[x], 2*w-1], {w, 1, lf[x]}] sb[x_] := Apply[Plus, ba[x]] ma[x_] := Part[Reverse[Flatten[FactorInteger[x]]], 2] amo[x_] := Abs[MoebiusMu[x]] Do[s=sb[n]/ma[n]; If[IntegerQ[s]&&Equal[lf[n], 6]&& !Equal[amo[n], 0], Print[{n, ba[n]}]], {n, 2, 1000000}]
%Y A071145 Cf. A008472, A006530, A000961, A025475, A037074, A071139-A071147.
%K A071145 nonn
%O A071145 1,1
%A A071145 _Labos Elemer_, May 13 2002