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.

A015745 Number of partitions of n into distinct parts, none being 3.

This page as a plain text file.
%I A015745 #21 Jul 03 2025 18:22:57
%S A015745 1,1,1,1,1,2,3,4,4,5,6,8,10,12,14,17,20,24,29,34,40,47,55,64,75,87,
%T A015745 101,117,135,155,179,205,235,269,307,350,399,453,514,583,660,746,843,
%U A015745 950,1070,1205,1354,1520,1705,1910,2138,2392,2672,2982,3326,3706,4126
%N A015745 Number of partitions of n into distinct parts, none being 3.
%H A015745 Vincenzo Librandi, <a href="/A015745/b015745.txt">Table of n, a(n) for n = 0..1000</a>
%F A015745 a(n) = A015737(n+3). - _Michel Marcus_, Feb 20 2014
%F A015745 a(n) ~ exp(Pi*sqrt(n/3)) / (8*3^(1/4)*n^(3/4)). - _Vaclav Kotesovec_, Oct 30 2015
%t A015745 CoefficientList[Series[Product[1+q^n, {n, 1, 60}]/(1+q^3), {q, 0, 60}], q]
%t A015745 Table[Count[Select[IntegerPartitions[n], DeleteDuplicates[#] == # &], x_ /; ! MemberQ[x, 3]], {n, 0, 56}] (* _Robert Price_, May 17 2020 *)
%Y A015745 Cf. A025147, A015744, A015746, A015750, A015753, A015754, A015755.
%K A015745 nonn
%O A015745 0,6
%A A015745 _Clark Kimberling_
%E A015745 Corrected and extended by _Dean Hickerson_, Oct 10 2001