cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A141667 Number of partitions of n times number of divisors of n.

This page as a plain text file.
%I A141667 #12 Jun 11 2018 17:29:03
%S A141667 1,4,6,15,14,44,30,88,90,168,112,462,202,540,704,1155,594,2310,980,
%T A141667 3762,3168,4008,2510,12600,5874,9744,12040,22308,9130,44832,13684,
%U A141667 50094,40572,49240,59532,161793,43274,104060,124740,298704,89166,425392,126522,451050
%N A141667 Number of partitions of n times number of divisors of n.
%H A141667 G. C. Greubel, <a href="/A141667/b141667.txt">Table of n, a(n) for n = 1..5000</a>
%F A141667 a(n) = p(n) * d(n) = A000041(n) * A000005(n).
%t A141667 f[n_] = DivisorSigma[0, n]*PartitionsP[n]; Table[f[n], {n, 1, 30}]
%o A141667 (PARI) al(n)=vector(n,k,numbpart(k)*numdiv(k))
%Y A141667 Cf. A000005, A000041, A144300, A195364.
%K A141667 nonn
%O A141667 1,2
%A A141667 _Roger L. Bagula_ and _Gary W. Adamson_, Sep 06 2008
%E A141667 Edited with more terms by _Franklin T. Adams-Watters_, Sep 16 2011