A099593 - OEIS

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

A099593

Sum of the number of e-divisors of all numbers from 2 up to n.

2

0, 1, 2, 4, 5, 6, 7, 9, 11, 12, 13, 15, 16, 17, 18, 21, 22, 24, 25, 27, 28, 29, 30, 32, 34, 35, 37, 39, 40, 41, 42, 44, 45, 46, 47, 51, 52, 53, 54, 56, 57, 58, 59, 61, 63, 64, 65, 68, 70, 72, 73, 75, 76, 78, 79, 81, 82, 83, 84, 86, 87, 88, 90, 94, 95, 96, 97, 99, 100, 101

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,3

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.

FORMULA

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

MATHEMATICA

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

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

CROSSREFS

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

Sequence in context: A350396 A255165 A047316 * A184867 A029903 A242871

Adjacent sequences: A099590 A099591 A099592 * A099594 A099595 A099596

KEYWORD

nonn

AUTHOR

Ralf Stephan, Oct 26 2004

STATUS

approved