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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A141667 Number of partitions of n times number of divisors of n. 1
 1, 4, 6, 15, 14, 44, 30, 88, 90, 168, 112, 462, 202, 540, 704, 1155, 594, 2310, 980, 3762, 3168, 4008, 2510, 12600, 5874, 9744, 12040, 22308, 9130, 44832, 13684, 50094, 40572, 49240, 59532, 161793, 43274, 104060, 124740, 298704, 89166, 425392, 126522, 451050 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS G. C. Greubel, Table of n, a(n) for n = 1..5000 FORMULA a(n) = p(n) * d(n) = A000041(n) * A000005(n). MATHEMATICA f[n_] = DivisorSigma[0, n]*PartitionsP[n]; Table[f[n], {n, 1, 30}] PROG (PARI) al(n)=vector(n, k, numbpart(k)*numdiv(k)) CROSSREFS Cf. A000005, A000041, A144300, A195364. Sequence in context: A214901 A284123 A135093 * A048753 A055719 A117883 Adjacent sequences:  A141664 A141665 A141666 * A141668 A141669 A141670 KEYWORD nonn AUTHOR Roger L. Bagula and Gary W. Adamson, Sep 06 2008 EXTENSIONS Edited with more terms by Franklin T. Adams-Watters, Sep 16 2011 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 December 4 13:06 EST 2021. Contains 349526 sequences. (Running on oeis4.)