login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A129628 Inverse Moebius transform of A001511. 5

%I #22 Sep 30 2020 03:29:10

%S 1,3,2,6,2,6,2,10,3,6,2,12,2,6,4,15,2,9,2,12,4,6,2,20,3,6,4,12,2,12,2,

%T 21,4,6,4,18,2,6,4,20,2,12,2,12,6,6,2,30,3,9,4,12,2,12,4,20,4,6,2,24,

%U 2,6,6,28,4,12,2,12,4,12,2,30,2,6,6,12,4,12,2,30,5,6,2,24,4,6,4,20

%N Inverse Moebius transform of A001511.

%H Amiram Eldar, <a href="/A129628/b129628.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1000 from Andrew Howroyd)

%F a(2n) = a(n) + A000005(2n), a(2n+1) = A000005(2n+1).

%F Dirichlet g.f.: zeta(s)^2 * 2^s/(2^s-1). - _Ralf Stephan_, Jun 17 2007, corrected by _Vaclav Kotesovec_, Feb 02 2019

%F a(n) = Sum_{d|n} A001511(d). - _Andrew Howroyd_, Aug 04 2018

%F Sum_{k=1..n} a(k) ~ 2*n * (2*gamma - 1 + log(n/2)), where gamma is the Euler-Mascheroni constant A001620. - _Vaclav Kotesovec_, Feb 02 2019

%F Multiplicative with a(2^e) = (e+1)*(e+2)/2, and a(p^e) = e+1 for p > 2. - _Amiram Eldar_, Sep 30 2020

%t f[p_, e_] := If[p==2, (e+1)*(e+2)/2, e+1]; a[1] = 1; a[n_] := Times @@ (f @@@ FactorInteger[n]); Array[a, 100] (* _Amiram Eldar_, Sep 30 2020 *)

%o (PARI) a(n)={sumdiv(n, d, 1 + valuation(d, 2))} \\ _Andrew Howroyd_, Aug 04 2018

%Y Row sums of A129353.

%Y Cf. A000005, A001511, A001620, A129628.

%K nonn,mult,easy

%O 1,2

%A _Ralf Stephan_, May 31 2007

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 31 14:41 EDT 2024. Contains 374801 sequences. (Running on oeis4.)