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

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A074369 Number of divisors of Sum_{i=1,...,n} prime(i). 0
 2, 2, 4, 2, 6, 2, 4, 4, 9, 4, 12, 2, 8, 2, 8, 4, 16, 4, 8, 6, 8, 4, 8, 6, 12, 8, 10, 4, 16, 8, 16, 4, 12, 4, 6, 4, 16, 4, 8, 12, 8, 6, 8, 4, 12, 4, 8, 4, 16, 8, 12, 12, 16, 4, 4, 8, 16, 4, 4, 2, 8, 6, 8, 2, 4, 4, 8, 8, 8, 8, 16, 4, 8, 8, 4, 8, 16, 6, 20, 12, 6, 4, 12, 16, 16, 8, 24, 12, 12, 8, 24 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS EXAMPLE The number of divisors of prime(1) + prime(2) + prime(3) = 2 + 3 + 5 = 10 is 4, so a(3) = 4. MATHEMATICA s = 0; l = {}; Do[s = s + Prime[i]; l = Append[l, DivisorSigma[0, s]], {i, 1, 100}]; l CROSSREFS Sequence in context: A284476 A082174 A278235 * A323407 A073348 A287093 Adjacent sequences:  A074366 A074367 A074368 * A074370 A074371 A074372 KEYWORD easy,nonn AUTHOR Joseph L. Pe, Sep 24 2002 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.

Last modified January 17 20:36 EST 2020. Contains 330987 sequences. (Running on oeis4.)