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!)
A337246 Sum of the first coordinates of all pairs of prime divisors of n, (p,q), such that p <= q. 3
0, 2, 3, 2, 5, 7, 7, 2, 3, 9, 11, 7, 13, 11, 11, 2, 17, 7, 19, 9, 13, 15, 23, 7, 5, 17, 3, 11, 29, 17, 31, 2, 17, 21, 17, 7, 37, 23, 19, 9, 41, 19, 43, 15, 11, 27, 47, 7, 7, 9, 23, 17, 53, 7, 21, 11, 25, 33, 59, 17, 61, 35, 13, 2, 23, 23, 67, 21, 29, 23, 71, 7, 73, 41, 11, 23, 25, 25, 79 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
a(n)=n if n is prime. - Robert Israel, Sep 17 2020
LINKS
FORMULA
a(n) = Sum_{p|n, q|n, p and q prime, p<=q} p.
EXAMPLE
a(6) = 7; There are 2 prime divisors of 6: {2,3}. If we list all of the ordered pairs (p,q) with p<=q, we get (2,2), (2,3) and (3,3). The sum of the first coordinates from each pair is 2 + 2 + 3 = 7.
a(10) = 9; There are 2 prime divisors of 10: {2,5}. If we list all of the ordered pairs (p,q) with p<=q, we get (2,2), (2,5) and (5,5). The sum of the first coordinates from each pair is 2 + 2 + 5 = 9.
MAPLE
f:= proc(n) local F, i, j;
F:= sort(convert(numtheory:-factorset(n), list), `>`);
add(i*F[i], i=1..nops(F))
end proc:
map(f, [$1..100]); # Robert Israel, Sep 17 2020
PROG
(PARI) a(n) = my(vp = factor(n)[, 1]~); sum(iq=1, #vp, sum(ip=1, iq, vp[ip])); \\ Michel Marcus, Aug 21 2020
CROSSREFS
Sequence in context: A344482 A092550 A058977 * A347104 A369687 A085818
KEYWORD
nonn
AUTHOR
Wesley Ivan Hurt, Aug 20 2020
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 August 11 08:53 EDT 2024. Contains 375059 sequences. (Running on oeis4.)