|
|
A203639
|
|
Multiplicative with a(p^e) = e*p^(e-1).
|
|
4
|
|
|
1, 1, 1, 4, 1, 1, 1, 12, 6, 1, 1, 4, 1, 1, 1, 32, 1, 6, 1, 4, 1, 1, 1, 12, 10, 1, 27, 4, 1, 1, 1, 80, 1, 1, 1, 24, 1, 1, 1, 12, 1, 1, 1, 4, 6, 1, 1, 32, 14, 10, 1, 4, 1, 27, 1, 12, 1, 1, 1, 4, 1, 1, 6, 192, 1, 1, 1, 4, 1, 1, 1, 72, 1, 1, 10, 4, 1, 1, 1, 32, 108, 1, 1, 4, 1, 1, 1, 12, 1, 6, 1, 4, 1, 1, 1, 80, 1, 14, 6, 40
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
LINKS
|
|
|
FORMULA
|
a(n)=1 for all squarefree n.
Dirichlet g.f.: zeta^2(s-1)*product_{primes p} (1-2*p^(1-s)+p^(2-2s)+p^(-s)). - R. J. Mathar, Jan 19 2012
|
|
MAPLE
|
local a, f, e ;
a :=1;
for f in ifactors(n)[2] do
e := op(2, f) ;
p := op(1, f) ;
a := a*e*p^(e-1) ;
end do;
a;
|
|
MATHEMATICA
|
Table[n*Times @@ Transpose[FactorInteger[n]][[2]] / Last[Select[Divisors[n], SquareFreeQ]], {n, 1, 100}] (* Vaclav Kotesovec, Dec 18 2019 *)
f[p_, e_] := e*p^(e-1); a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Sep 21 2020 *)
|
|
PROG
|
(PARI) for(n=1, 100, print1(direuler(p=2, n, (1 + X/(1 - p*X)^2))[n], ", ")) \\ Vaclav Kotesovec, Jun 14 2020
(Scheme, with memoization-macro definec)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,mult,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
Terms a(1)-a(24) confirmed and terms a(25)-a(100) added by John W. Layman, Jan 04 2012
|
|
STATUS
|
approved
|
|
|
|