|
%I #26 Jan 07 2019 02:19:38
%S 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,
%T 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,
%U 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
%N If n = Product (p_j^k_j) then a(n) = Sum (k_j^p_j).
%H Vincenzo Librandi, <a href="/A008476/b008476.txt">Table of n, a(n) for n = 1..10000</a>
%F Additive with a(p^e) = e^p.
%p A008476 := proc(n) local e,j; e := ifactors(n)[2]:
%p add (e[j][2]^e[j][1], j=1..nops(e)) end:
%p seq (A008476(n), n=1..80);
%p # _Peter Luschny_, Jan 17 2011
%t Prepend[ Array[ Plus @@ Map[ Power @@ RotateLeft[ #1, 1 ]&, FactorInteger[ # ] ]&, 100, 2 ], 1 ]
%t Total[ #2^#1 & @@@ FactorInteger[ # ]] & /@ Range[100] (* Peter Pein (petsie(AT)dordos.net), Dec 21 2007 *)
%o (PARI) for(n=1, 110, print1(sum(i=1, omega(n), component(component(factor(n), 2), i)^component(component(factor(n), 1), i)), ", "))
%K nonn
%O 1,4
%A _Olivier Gérard_
%E More terms from _Benoit Cloitre_, Jun 07 2002
|
