The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A066911 Sum of primes < n that do not divide n. 6
 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, 85, 97, 91, 100, 119, 129, 158, 146, 141, 148, 155, 160, 176, 181, 190, 197, 226, 238, 268, 273, 256, 281, 323, 321, 321, 308, 313, 328, 376, 365, 372, 359, 350, 381, 430 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS Equals row sums of triangle A143655. - Gary W. Adamson, Aug 28 2008 LINKS Michael De Vlieger, Table of n, a(n) for n = 1..10000 FORMULA a(prime(n)) = A007504(n-1). - Michel Marcus, May 20 2014 EXAMPLE a(8) = 3 + 5 + 7 = 15 because 3, 5 and 7 are the primes < 8 that do not divide 8. MATHEMATICA Table[Total@ Complement[Prime@ Range@ PrimePi@ n, FactorInteger[n][[All, 1]]], {n, 60}] (* Michael De Vlieger, Sep 04 2017 *) PROG (PARI) a(n) = sum(i=1, n-1, if (isprime(i) && (n%i), i)); \\ Michel Marcus, May 20 2014 CROSSREFS Cf. A007504, A143655. Sequence in context: A140312 A088887 A265546 * A326229 A326187 A071850 Adjacent sequences: A066908 A066909 A066910 * A066912 A066913 A066914 KEYWORD nonn AUTHOR Leroy Quet, Jan 22 2002 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified March 27 18:31 EDT 2023. Contains 361575 sequences. (Running on oeis4.)