|
Search: id:A008476
|
|
|
| A008476 |
|
If n = Product (p_j^k_j) then a(n) = Sum (k_j^p_j). |
|
+0 1
|
|
| 0, 1, 1, 4, 1, 2, 1, 9, 8, 2, 1, 5, 1, 2, 2, 16, 1, 9, 1, 5, 2, 2, 1, 10, 32, 2, 27, 5, 1, 3, 1, 25, 2, 2, 2, 12, 1, 2, 2, 10, 1, 3, 1, 5, 9, 2, 1, 17, 128, 33, 2, 5, 1, 28, 2, 10, 2, 2, 1, 6, 1, 2, 9, 36, 2, 3, 1, 5, 2, 3, 1, 17, 1, 2, 33, 5, 2, 3, 1, 17, 64, 2, 1, 6, 2, 2, 2, 10, 1, 10, 2, 5, 2, 2, 2, 26
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
FORMULA
|
Additive with a(p^e) = e^p.
|
|
MATHEMATICA
|
Prepend[ Array[ Plus @@ Map[ Power @@ RotateLeft[ #1, 1 ]&, FactorInteger[ # ] ]&, 100, 2 ], 1 ]
Total[ #2^#1 & @@@ FactorInteger[ # ]] & /@ Range[100] - Peter Pein (petsie(AT)dordos.net), Dec 21 2007
|
|
PROGRAM
|
(PARI) for(n=1, 110, print1(sum(i=1, omega(n), component(component(factor(n), 2), i)^component(component(factor(n), 1), i)), ", "))
|
|
CROSSREFS
|
Sequence in context: A126241 A019777 A090885 this_sequence A112621 A081448 A106437
Adjacent sequences: A008473 A008474 A008475 this_sequence A008477 A008478 A008479
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Olivier Gerard (olivier.gerard(AT)gmail.com)
|
|
EXTENSIONS
|
More terms from Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 07 2002
|
|
|
Search completed in 0.002 seconds
|