# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a241068
Showing 1-1 of 1

%I A241068 #5 Apr 24 2014 10:28:38
%S A241068 0,1,0,1,1,2,3,3,5,6,8,10,13,15,20,23,29,35,42,49,60,71,84,98,116,135,
%T A241068 158,184,214,248,286,329,380,436,500,572,654,745,848,965,1094,1242,
%U A241068 1406,1588,1794,2023,2278,2563,2881,3234,3626,4063,4546,5083,5677
%N A241068 Number of partitions p of n into distinct parts such that max(p) >= -1 + 2*min(p).
%e A241068 a(8) counts these 5 partitions:  71, 62, 53, 521, 431.
%t A241068 z = 70; f[n_] := f[n] = Select[IntegerPartitions[n], Max[Length /@ Split@#] == 1 &];
%t A241068 Table[Count[f[n], p_ /; Max[p] < -1 + 2*Min[p]], {n, 0, z}]  (* A241065 *)
%t A241068 Table[Count[f[n], p_ /; Max[p] <= -1 + 2*Min[p]], {n, 0, z}] (* A240874 *)
%t A241068 Table[Count[f[n], p_ /; Max[p] == -1 + 2*Min[p]], {n, 0, z}] (* A241067 *)
%t A241068 Table[Count[f[n], p_ /; Max[p] >= -1 + 2*Min[p]], {n, 0, z}] (* A241068 *)
%t A241068 Table[Count[f[n], p_ /; Max[p] > -1 + 2*Min[p]], {n, 0, z}]  (* A241036 *)
%Y A241068 Cf. A241065, A240874, A241067, A241036.
%K A241068 nonn,easy
%O A241068 0,6
%A A241068 _Clark Kimberling_, Apr 16 2014

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE