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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A237349 a(n) = Sum_{i=1..n} ( Product_{k|i} d(k) ), where d(n) = A000005(n). 3
 1, 3, 5, 11, 13, 29, 31, 55, 61, 77, 79, 367, 369, 385, 401, 521, 523, 811, 813, 1101, 1117, 1133, 1135, 10351, 10357, 10373, 10397, 10685, 10687, 14783, 14785, 15505, 15521, 15537, 15553, 62209, 62211, 62227, 62243, 71459, 71461, 75557, 75559, 75847, 76135 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Sum of all the products formed by multiplying together the number of divisors of each divisor of the numbers from 1 to n. Partial sums of A211776. [Joerg Arndt, Feb 11 2014] LINKS FORMULA a(n) = Sum_{i=1..n} ( Product_{k|i} A000005(k) ). EXAMPLE a(3) = 5. Sum_{i=1..3} ( Product_{k|i} d(k) ) = ( Product_{k|1} d(k) ) + ( Product_{k|2} d(k) ) + ( Product_{k|3} d(k) ) = ( d(1) ) + ( d(1) * d(2) ) + ( d(1) * d(3) ) = 1 + (1)(2) + (1)(2) = 5. MAPLE with(numtheory); A237349:=n->add(mul(tau(k)^(1-ceil(i/k)+floor(i/k)), k=1..i), i=1..n); seq(A237349(n), n=1..50); MATHEMATICA Table[Sum[Product[DivisorSigma[0, k]^(1-Ceiling[i/k]+Floor[i/k]), {k, i}], {i, n}], {n, 50}] CROSSREFS Cf. A000005, A211776. Sequence in context: A243897 A153075 A287940 * A095082 A265396 A216553 Adjacent sequences:  A237346 A237347 A237348 * A237350 A237351 A237352 KEYWORD nonn,easy AUTHOR Wesley Ivan Hurt, Feb 06 2014 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 July 26 10:35 EDT 2021. Contains 346294 sequences. (Running on oeis4.)