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.

A141668 a(n) = tau(n) * (NumberOfPartitions(n) - 1).

This page as a plain text file.
%I A141668 #15 Jun 12 2018 10:23:37
%S A141668 0,0,2,4,12,12,40,28,84,87,164,110,456,200,536,700,1150,592,2304,978,
%T A141668 3756,3164,4004,2508,12592,5871,9740,12036,22302,9128,44824
%N A141668 a(n) = tau(n) * (NumberOfPartitions(n) - 1).
%H A141668 G. C. Greubel, <a href="/A141668/b141668.txt">Table of n, a(n) for n = 0..5000</a>
%F A141668 a(n) = A000005(n)*(A000041(n) - 1) = A000005(n)*A000065(n).
%t A141668 f[n_] = DivisorSigma[0, n]*PartitionsP[n] - DivisorSigma[0, n]; Table[f[n], {n, 1, 30}]
%o A141668 (PARI) a(n) = if (n, numdiv(n)*(numbpart(n)-1), 0); \\ _Michel Marcus_, Jun 11 2018
%Y A141668 Cf. A000005, A000041.
%K A141668 nonn
%O A141668 0,3
%A A141668 _Roger L. Bagula_ and _Gary W. Adamson_, Sep 06 2008