login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A015745 Number of partitions of n into distinct parts, none being 3. 9

%I #19 May 18 2020 06:38:37

%S 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 101,117,135,155,179,205,235,269,307,350,399,453,514,583,660,746,843,

%U 950,1070,1205,1354,1520,1705,1910,2138,2392,2672,2982,3326,3706,4126

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

%H Vincenzo Librandi, <a href="/A015745/b015745.txt">Table of n, a(n) for n = 0..1000</a>

%F a(n) = A015737(n+3). - _Michel Marcus_, Feb 20 2014

%F a(n) ~ exp(Pi*sqrt(n/3)) / (8*3^(1/4)*n^(3/4)). - _Vaclav Kotesovec_, Oct 30 2015

%t CoefficientList[Series[Product[1+q^n, {n, 1, 60}]/(1+q^3), {q, 0, 60}], q]

%t Table[Count[Select[IntegerPartitions[n], DeleteDuplicates[#] == # &], x_ /; ! MemberQ[x, 3]], {n, 0, 56}] (* _Robert Price_, May 17 2020 *)

%Y Cf. A025147, A015744, A015746, A015750, A015753, A015754, A015755.

%K nonn

%O 0,6

%A _Clark Kimberling_

%E Corrected and extended by _Dean Hickerson_, Oct 10, 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 20 16:40 EDT 2024. Contains 374459 sequences. (Running on oeis4.)