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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

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
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, 36, 38, 40, 41, 42, 43, 45, 46, 47, 48, 52, 53, 54, 55, 57, 58, 59, 60, 62, 64, 65, 66, 69, 71, 73, 74, 76, 77, 79, 80, 82, 83, 84, 85, 87, 88, 89, 91, 95, 96, 97, 98, 100, 101, 102, 103, 107 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Amiram Eldar, Table of n, a(n) for n = 1..10000

J. Wu, Problème de diviseurs exponentiels et entiers exponentiellement sans facteur carré, J. Theor. Nombr. Bordeaux 7 (1) (1995) 133-141.

MATHEMATICA

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

CROSSREFS

Equals partial sums of A049419. Cf. A099353.

Different from A013936 (which does not contain 52).

Sequence in context: A179813 A191914 A329898 * A013936 A229992 A076437

Adjacent sequences:  A145350 A145351 A145352 * A145354 A145355 A145356

KEYWORD

nonn

AUTHOR

Jaroslav Krizek and N. J. A. Sloane, Mar 03 2009

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 28 07:44 EST 2020. Contains 338702 sequences. (Running on oeis4.)