login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A122411 a(n) = sum of primes p's for those k's, 2 <= k <= n, where GCD(k,n) = p^j >1. (a(1) = 0.). 1
0, 2, 3, 4, 5, 7, 7, 8, 9, 13, 11, 14, 13, 19, 22, 16, 17, 21, 19, 26, 32, 31, 23, 28, 25, 37, 27, 38, 29, 38, 31, 32, 52, 49, 58, 42, 37, 55, 62, 52, 41, 56, 43, 62, 66, 67, 47, 56, 49, 65, 82, 74, 53, 63, 94, 76, 92, 85, 59, 76, 61, 91, 96, 64, 112, 92, 67, 98, 112, 106, 71 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..71.

EXAMPLE

The integers k, 2 <= k <= 12, where GCD(k,12) = a power of a prime are 2,3,4,8,9 and 10. GCD(2,12) = 2^1, GCD(3,12) = 3^1, GCD(4,12) = 2^2, GCD(8, 12) = 2^2, GCD(9,12) = 3^1 and GCD(10,12) = 2^1. The sum of the prime bases of the prime-powers is 2+3+2+2+3+2 = 14. So a(12) = 14.

MATHEMATICA

f[n_] := Plus @@ First /@ Flatten[Select[FactorInteger[GCD[Range[n], n]], Length[ # ] == 1 &], 1]; Table[f[n], {n, 80}] (*Chandler*)

CROSSREFS

Cf. A122410.

Sequence in context: A034152 A114707 A000015 * A117174 A237824 A227972

Adjacent sequences:  A122408 A122409 A122410 * A122412 A122413 A122414

KEYWORD

nonn

AUTHOR

Leroy Quet, Sep 02 2006

EXTENSIONS

Corrected and extended by Ray Chandler, Sep 06 2006

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified December 5 03:30 EST 2016. Contains 278755 sequences.