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!)
A240858 Number of partitions p of n into distinct parts not including max(p) - min(p). 2

%I #7 Sep 27 2014 04:58:57

%S 0,1,1,1,2,3,2,5,5,6,7,12,11,16,16,23,27,33,35,47,52,65,75,88,101,121,

%T 139,164,190,219,249,294,334,384,443,504,577,659,746,851,971,1097,

%U 1242,1409,1585,1790,2023,2271,2557,2873,3221,3612,4049,4521,5054,5651

%N Number of partitions p of n into distinct parts not including max(p) - min(p).

%F a(n) + A240852(n) = A000009(n) for n >= 0.

%e a(10) counts all 10 partitions of 10 into distinct parts except for 541, 532, 4321, so that a(10) = 7.

%t z = 40; f[n_] := f[n] = Select[IntegerPartitions[n], Max[Length /@ Split@#] == 1 &]; Table[Count[f[n], p_ /; MemberQ[p, Max[p] - Min[p]]], {n, 0, z}] (* A240852 *)

%t Table[Count[f[n], p_ /; !MemberQ[p, Max[p] - Min[p]]], {n, 0, z}] (* A240858 *)

%Y Cf. A240852, A000009.

%K nonn,easy

%O 0,5

%A _Clark Kimberling_, Apr 14 2014

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 April 25 09:38 EDT 2024. Contains 371967 sequences. (Running on oeis4.)