login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


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

%I

%S 1,1,1,2,2,3,4,5,5,7,9,10,13,15,18,22,27,31,37,44,51,61,71,82,95,111,

%T 128,148,171,195,225,258,295,337,384,437,497,565,639,724,818,923,1042,

%U 1173,1319,1483,1665,1866,2092,2341,2616,2924,3263,3637,4053,4512,5016

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

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

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

%F a(n) = A000009(n) - a(n-8) for n >= 0, a(n) = 0 otherwise. - _Yuchun Ji_, Dec 25 2018

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

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

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

%K nonn

%O 0,4

%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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 25 03:40 EDT 2021. Contains 345449 sequences. (Running on oeis4.)