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!)
 A240858 Number of partitions p of n into distinct parts not including max(p) - min(p). 2
 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, 139, 164, 190, 219, 249, 294, 334, 384, 443, 504, 577, 659, 746, 851, 971, 1097, 1242, 1409, 1585, 1790, 2023, 2271, 2557, 2873, 3221, 3612, 4049, 4521, 5054, 5651 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 LINKS FORMULA a(n) + A240852(n) = A000009(n) for n >= 0. EXAMPLE a(10) counts all 10 partitions of 10 into distinct parts except for 541, 532, 4321, so that a(10) = 7. MATHEMATICA 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 *)     Table[Count[f[n], p_ /; !MemberQ[p, Max[p] - Min[p]]], {n, 0, z}] (* A240858 *) CROSSREFS Cf. A240852, A000009. Sequence in context: A144307 A144310 A330049 * A035361 A137851 A141346 Adjacent sequences:  A240855 A240856 A240857 * A240859 A240860 A240861 KEYWORD nonn,easy AUTHOR Clark Kimberling, Apr 14 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 September 24 13:43 EDT 2021. Contains 347643 sequences. (Running on oeis4.)