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.

A304783 Expansion of Product_{k>=1} (1 - x^k)^q(k), where q(k) = number of partitions of k into distinct parts (A000009).

This page as a plain text file.
%I A304783 #5 Feb 16 2025 08:33:54
%S A304783 1,-1,-1,-1,0,1,0,3,2,3,1,3,-2,0,-6,-8,-12,-14,-18,-19,-19,-15,-3,4,
%T A304783 29,46,90,114,165,192,248,252,276,232,185,29,-143,-454,-811,-1324,
%U A304783 -1909,-2609,-3348,-4132,-4851,-5386,-5653,-5380,-4470,-2477,664,5582,12193,21314
%N A304783 Expansion of Product_{k>=1} (1 - x^k)^q(k), where q(k) = number of partitions of k into distinct parts (A000009).
%C A304783 Convolution inverse of A089259.
%H A304783 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PartitionFunctionQ.html">Partition Function Q</a>
%H A304783 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%F A304783 G.f.: Product_{k>=1} (1 - x^k)^A000009(k).
%t A304783 nmax = 53; CoefficientList[Series[Product[(1 - x^k)^PartitionsQ[k], {k, 1, nmax}], {x, 0, nmax}], x]
%t A304783 a[n_] := a[n] = If[n == 0, 1, Sum[-Sum[d PartitionsQ[d], {d, Divisors[k]}] a[n - k], {k, 1, n}]/n]; Table[a[n], {n, 0, 53}]
%Y A304783 Cf. A000009, A050342, A089254, A089259, A300508.
%K A304783 sign
%O A304783 0,8
%A A304783 _Ilya Gutkovskiy_, May 18 2018