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.

A300585 Number of partitions of n into squarefree parts that do not divide n.

This page as a plain text file.
%I A300585 #5 Mar 09 2018 21:15:53
%S A300585 1,0,0,0,0,1,0,2,1,2,1,7,1,12,3,4,8,29,2,42,8,18,18,87,7,71,36,67,32,
%T A300585 234,3,319,98,126,118,192,31,772,205,293,98,1347,21,1763,338,295,574,
%U A300585 2973,116,2290,298,1359,932,6287,214,2670,843,2744,2334,12828,66,16155,3620,2835,4584,8380
%N A300585 Number of partitions of n into squarefree parts that do not divide n.
%H A300585 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%e A300585 a(14) = 3 because we have [11, 3], [6, 5, 3] and [5, 3, 3, 3].
%t A300585 Table[SeriesCoefficient[Product[1/(1 - Boole[Mod[n, k] != 0 && SquareFreeQ[k]] x^k), {k, 1, n}], {x, 0, n}], {n, 0, 65}]
%Y A300585 Cf. A005117, A073576, A098743, A128515, A225244, A300580, A300586.
%K A300585 nonn
%O A300585 0,8
%A A300585 _Ilya Gutkovskiy_, Mar 09 2018