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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A237757 Number of partitions of n such that 2*(least part) = (number of parts). 15
 0, 1, 1, 1, 1, 1, 1, 2, 2, 3, 4, 5, 6, 8, 9, 11, 13, 16, 18, 22, 25, 30, 35, 41, 47, 56, 64, 75, 86, 100, 114, 133, 151, 174, 198, 227, 257, 295, 333, 379, 428, 486, 547, 620, 696, 786, 882, 993, 1111, 1250, 1396, 1565, 1747, 1954, 2176, 2431, 2703, 3013 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,8 LINKS Robert Israel, Table of n, a(n) for n = 1..10000 EXAMPLE a(8) = 2 counts these partitions: 71, 2222. MAPLE f:= proc(n) local t, k, np;   t:= 0;   for k from 1 do     np:= n - 1 - 2*k*(k-1);     if np < 2*k-1 then return t fi;     t:= t + combinat:-numbpart(np, 2*k-1) - combinat:-numbpart(np, 2*k-2)   od; end proc: map(f, [\$1..100]); # Robert Israel, Jul 01 2020 MATHEMATICA z = 50; Table[Count[IntegerPartitions[n], p_ /; 2 Min[p] == Length[p]], {n, z}] CROSSREFS Cf. A237753. Sequence in context: A286316 A027198 A238215 * A027197 A332577 A137793 Adjacent sequences:  A237754 A237755 A237756 * A237758 A237759 A237760 KEYWORD nonn,easy AUTHOR Clark Kimberling, Feb 13 2014 STATUS approved

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.

Last modified October 1 17:45 EDT 2020. Contains 337444 sequences. (Running on oeis4.)