|
Search: id:A074374
|
|
|
| A074374 |
|
s(s+1)/2 where s is the sum of the prime factors of n (with repetition). |
|
+0
4
|
|
| 0, 0, 3, 6, 10, 15, 15, 28, 21, 21, 28, 66, 28, 91, 45, 36, 36, 153, 36, 190, 45, 55, 91, 276, 45, 55, 120, 45, 66, 435, 55, 496, 55, 105, 190, 78, 55, 703, 231, 136, 66, 861, 78, 946, 120, 66, 325, 1128, 66, 105, 78, 210, 153, 1431, 66, 136, 91, 253, 496, 1770, 78
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
LINKS
|
Neville Holmes, Integer Sequence Combinations
|
|
EXAMPLE
|
a(10)=7(7+1)/2=28 because 7 is the sum of the prime factors of 10.
|
|
PROGRAM
|
(PARI) s(n)=sum(i=1, omega(n), component(component(factor(n), 1), i)*component(component(factor(n), 2), i))); a(n)=s(n)*(s(n)+1)/2
|
|
CROSSREFS
|
A000217 applied to A001414. Cf. A074372.
Sequence in context: A105333 A126234 A130484 this_sequence A109804 A120993 A083266
Adjacent sequences: A074371 A074372 A074373 this_sequence A074375 A074376 A074377
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Neville Holmes (neville.holmes(AT)utas.edu.au), Aug 29 2002
|
|
EXTENSIONS
|
More terms from Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 02 2002
|
|
|
Search completed in 0.002 seconds
|
