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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A145353 Sum of the number of e-divisors of all numbers from 1 up to n. 4

%I

%S 1,2,3,5,6,7,8,10,12,13,14,16,17,18,19,22,23,25,26,28,29,30,31,33,35,

%T 36,38,40,41,42,43,45,46,47,48,52,53,54,55,57,58,59,60,62,64,65,66,69,

%U 71,73,74,76,77,79,80,82,83,84,85,87,88,89,91,95,96,97,98,100,101,102,103,107

%N Sum of the number of e-divisors of all numbers from 1 up to n.

%H Amiram Eldar, <a href="/A145353/b145353.txt">Table of n, a(n) for n = 1..10000</a>

%H J. Wu, <a href="http://dx.doi.org/10.5802/jtnb.136">Problème de diviseurs exponentiels et entiers exponentiellement sans facteur carré</a>, J. Theor. Nombr. Bordeaux 7 (1) (1995) 133-141.

%t f[p_, e_] := DivisorSigma[0, e]; ediv[n_] := Times @@ (f @@@ FactorInteger[n]); Accumulate[Array[ediv, 100]] (* _Amiram Eldar_, Jun 23 2019 *)

%Y Equals partial sums of A049419. Cf. A099353.

%Y Different from A013936 (which does not contain 52).

%K nonn

%O 1,2

%A _Jaroslav Krizek_ and _N. J. A. Sloane_, Mar 03 2009

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 21 07:15 EST 2021. Contains 340335 sequences. (Running on oeis4.)