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!)
A139130 a(n) = sum{k=1 to n} d(d(k)), where d(k) = number of divisors of k. 2
1, 3, 5, 7, 9, 12, 14, 17, 19, 22, 24, 28, 30, 33, 36, 38, 40, 44, 46, 50, 53, 56, 58, 62, 64, 67, 70, 74, 76, 80, 82, 86, 89, 92, 95, 98, 100, 103, 106, 110, 112, 116, 118, 122, 126, 129, 131, 135, 137, 141, 144, 148, 150, 154, 157, 161, 164, 167, 169, 175, 177, 180 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

REFERENCES

R. Bellman and H. N. Shapiro, On a problem in additive number theory, Annals Math., 49 (1948), 333-340. See Eq. 1.6. [From N. J. A. Sloane, Mar 12 2009]

LINKS

Alois P. Heinz, Table of n, a(n) for n = 1..1000

MAPLE

with(numtheory): a:= n-> add(tau(tau (k)), k=1..n): seq(a(n), n=1..70); # Alois P. Heinz, Aug 28 2008

MATHEMATICA

Table[Sum[DivisorSigma[0, DivisorSigma[0, k]], {k, 1, n}], {n, 1, 62}] (* Geoffrey Critzer, Sep 28 2013 *)

PROG

(PARI) a(n) = sum(k = 1, n, numdiv(numdiv(k))); \\ Michel Marcus, Sep 28 2013

CROSSREFS

Cf. A010553, A006218.

Sequence in context: A198082 A082767 A047932 * A219087 A186705 A072154

Adjacent sequences:  A139127 A139128 A139129 * A139131 A139132 A139133

KEYWORD

nonn

AUTHOR

Leroy Quet, Jun 05 2008

EXTENSIONS

More terms from Alois P. Heinz, Aug 28 2008

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 June 22 14:22 EDT 2021. Contains 345380 sequences. (Running on oeis4.)