The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A099593 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A099593

Sum of the number of e-divisors of all numbers from 2 up to n.
(history; published version)

#12 by Vaclav Kotesovec at Mon Feb 27 13:26:43 EST 2023

STATUS

editing

approved

#11 by Vaclav Kotesovec at Mon Feb 27 13:26:36 EST 2023

FORMULA

a(n) ~ A327837 * n. - Vaclav Kotesovec, Feb 27 2023

#10 by Vaclav Kotesovec at Mon Feb 27 13:21:51 EST 2023

CROSSREFS

Equals - 1 + partial sums of A049419. Cf. A145353, A327837.

STATUS

approved

editing

#9 by Alois P. Heinz at Sun Jun 23 17:50:21 EDT 2019

STATUS

proposed

approved

#8 by Amiram Eldar at Sun Jun 23 17:38:12 EDT 2019

STATUS

editing

proposed

#7 by Amiram Eldar at Sun Jun 23 17:38:06 EDT 2019

LINKS

Amiram Eldar, <a href="/A099593/b099593.txt">Table of n, a(n) for n = 1..10000</a>

MATHEMATICA

f[p_, e_] := DivisorSigma[0, e]; ediv[n_] := Times @@ (f @@@ FactorInteger[n]);

Accumulate[Array[ediv, 100]] - 1 (* Amiram Eldar, Jun 23 2019 *)

STATUS

approved

editing

#6 by Bruno Berselli at Wed May 09 03:12:32 EDT 2018

STATUS

proposed

approved

#5 by Michel Marcus at Wed May 09 02:01:46 EDT 2018

STATUS

editing

proposed

#4 by Michel Marcus at Wed May 09 02:01:35 EDT 2018

LINKS

J. Wu, <a href="http://wwwdx.emisdoi.de/journals/JTNBorg/1995-110.5802/jtnb7-1_englishjtnb.html#jourelec136">Probleme Problème de diviseurs exponentiels... et entiers exponentiellement sans facteur carré</a>, J. Theor. Nombr. Bordeaux 7 (1) (1995) 133-141.

STATUS

approved

editing

Discussion

Wed May 09

02:01

Michel Marcus: better link

#3 by Charles R Greathouse IV at Wed Apr 30 01:27:40 EDT 2014

AUTHOR

_Ralf Stephan, _, Oct 26 2004

Discussion

Wed Apr 30

01:27

OEIS Server: https://oeis.org/edit/global/2165