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 A066911 #17 Sep 04 2017 23:28:25
%S A066911 0,0,2,3,5,5,10,15,14,10,17,23,28,32,33,39,41,53,58,70,67,64,77,95,95,
%T A066911 85,97,91,100,119,129,158,146,141,148,155,160,176,181,190,197,226,238,
%U A066911 268,273,256,281,323,321,321,308,313,328,376,365,372,359,350,381,430
%N A066911 Sum of primes < n that do not divide n.
%C A066911 Equals row sums of triangle A143655. - _Gary W. Adamson_, Aug 28 2008
%H A066911 Michael De Vlieger, <a href="/A066911/b066911.txt">Table of n, a(n) for n = 1..10000</a>
%F A066911 a(prime(n)) = A007504(n-1). - _Michel Marcus_, May 20 2014
%e A066911 a(8) = 3 + 5 + 7 = 15 because 3, 5 and 7 are the primes < 8 that do not divide 8.
%t A066911 Table[Total@ Complement[Prime@ Range@ PrimePi@ n, FactorInteger[n][[All, 1]]], {n, 60}] (* _Michael De Vlieger_, Sep 04 2017 *)
%o A066911 (PARI) a(n) = sum(i=1, n-1, if (isprime(i) && (n%i), i)); \\ _Michel Marcus_, May 20 2014
%Y A066911 Cf. A007504, A143655.
%K A066911 nonn
%O A066911 1,3
%A A066911 _Leroy Quet_, Jan 22 2002