The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A181835 The sum of the primes <= n that are strongly prime to n. 9
0, 0, 0, 0, 0, 3, 0, 5, 8, 12, 7, 10, 12, 23, 19, 24, 31, 39, 36, 53, 51, 60, 54, 64, 72, 90, 80, 82, 88, 91, 90, 119, 127, 144, 127, 129, 143, 155, 139, 160, 174, 190, 185, 226, 225, 260, 248, 256 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,6
COMMENTS
k is strongly prime to n iff k is relatively prime to n and k does not divide n-1.
LINKS
Peter Luschny, Strong coprimality.
EXAMPLE
a(11) = 3 + 7 = 10.
MAPLE
with(numtheory):
Primes := n -> select(k->isprime(k), {$1..n}):
StrongCoprimes := n -> select(k->igcd(k, n)=1, {$1..n}) minus divisors(n-1):
StrongCoprimePrimes := n -> Primes(n) intersect StrongCoprimes(n):
A181835 := proc(n) local i; add(i, i=StrongCoprimePrimes(n)) end:
MATHEMATICA
a[n_] := Select[Range[2, n], PrimeQ[#] && CoprimeQ[#, n] && !Divisible[n-1, #] &] // Total; Table[a[n], {n, 0, 47}] (* Jean-François Alcover, Jun 28 2013 *)
CROSSREFS
Sequence in context: A013673 A188639 A103229 * A076296 A260934 A143280
KEYWORD
nonn
AUTHOR
Peter Luschny, Nov 17 2010
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 23 01:37 EDT 2024. Contains 372758 sequences. (Running on oeis4.)