cp's OEIS Frontend

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.

A066911 Sum of primes < n that do not divide n.

Original entry on oeis.org

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
Offset: 1

Views

Author

Leroy Quet, Jan 22 2002

Keywords

Comments

Equals row sums of triangle A143655. - Gary W. Adamson, Aug 28 2008

Examples

			a(8) = 3 + 5 + 7 = 15 because 3, 5 and 7 are the primes < 8 that do not divide 8.
		

Crossrefs

Programs

  • Mathematica
    Table[Total@ Complement[Prime@ Range@ PrimePi@ n, FactorInteger[n][[All, 1]]], {n, 60}] (* Michael De Vlieger, Sep 04 2017 *)
  • PARI
    a(n) = sum(i=1, n-1, if (isprime(i) && (n%i), i)); \\ Michel Marcus, May 20 2014

Formula

a(prime(n)) = A007504(n-1). - Michel Marcus, May 20 2014