The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A326306 Dirichlet g.f.: zeta(s) * zeta(s-1) * Product_{p prime} (1 - p^(1 - s) + p^(-s)). 3
 1, 2, 2, 4, 2, 4, 2, 8, 5, 4, 2, 8, 2, 4, 4, 16, 2, 10, 2, 8, 4, 4, 2, 16, 7, 4, 14, 8, 2, 8, 2, 32, 4, 4, 4, 20, 2, 4, 4, 16, 2, 8, 2, 8, 10, 4, 2, 32, 9, 14, 4, 8, 2, 28, 4, 16, 4, 4, 2, 16, 2, 4, 10, 64, 4, 8, 2, 8, 4, 8, 2, 40, 2, 4, 14, 8, 4, 8, 2, 32, 41, 4, 2, 16, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Inverse Moebius transform of A003557. Dirichlet convolution of A000203 with A097945. LINKS Vaclav Kotesovec, Table of n, a(n) for n = 1..10000 S. R. Finch, Idempotents and Nilpotents Modulo n, arXiv:math/0605019 [math.NT], 2006-2017. FORMULA G.f.: Sum_{k>=1} (k / rad(k)) * x^k / (1 - x^k), where rad = A007947. a(n) = Sum_{d|n} A003557(d). a(n) = Sum_{d|n} mu(n/d) * phi(n/d) * sigma(d), where mu = A008683, phi = A000010 and sigma = A000203. a(p) = 2, where p is prime. From Vaclav Kotesovec, Jun 20 2020: (Start) Dirichlet g.f.: zeta(s) * Product_{primes p} (1 + 1/(p^s - p)). Dirichlet g.f.: zeta(s) * zeta(2*s-2) * Product_{primes p} (1 + p^(1-2*s) - p^(2-2*s) + p^(-s)). (End) Conjecture: Sum_{k=1..n} a(k) = O(n * log(n)^2). - Vaclav Kotesovec, Jun 22 2020 Multiplicative with a(p^e) = 1 + (p^e-1)/(p-1). - Amiram Eldar, Oct 14 2020 MATHEMATICA Table[Sum[d/Last[Select[Divisors[d], SquareFreeQ]], {d, Divisors[n]}], {n, 1, 85}] Table[Sum[MoebiusMu[n/d] EulerPhi[n/d] DivisorSigma[1, d], {d, Divisors[n]}], {n, 1, 85}] f[p_, e_] := 1 + (p^e-1)/(p-1); a[1] = 1; a[n_] := Times @@ (f @@@ FactorInteger[n]); Array[a, 100] (* Amiram Eldar, Oct 14 2020 *) PROG (PARI) for(n=1, 100, print1(direuler(p=2, n, (1 - p*X + X)/(1 - X)/(1 - p*X))[n], ", ")) \\ Vaclav Kotesovec, Jun 14 2020 CROSSREFS Cf. A000010, A000079 (fixed points), A000203, A003557, A007947, A008683, A098108 (parity of a(n)), A191750, A300717, A335032. Sequence in context: A061142 A318312 A318474 * A278525 A318476 A226083 Adjacent sequences:  A326303 A326304 A326305 * A326307 A326308 A326309 KEYWORD nonn,mult,easy AUTHOR Ilya Gutkovskiy, Oct 17 2019 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 29 17:37 EDT 2020. Contains 338067 sequences. (Running on oeis4.)