cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A240852 Number of partitions p of n into distinct parts including max(p) - min(p).

Original entry on oeis.org

0, 0, 0, 1, 0, 0, 2, 0, 1, 2, 3, 0, 4, 2, 6, 4, 5, 5, 11, 7, 12, 11, 14, 16, 21, 21, 26, 28, 32, 37, 47, 46, 56, 64, 69, 81, 91, 101, 118, 131, 142, 163, 184, 201, 231, 258, 281, 319, 353, 391, 437, 485, 533, 599, 664, 727, 809, 894, 979, 1091, 1201, 1316
Offset: 0

Views

Author

Clark Kimberling, Apr 14 2014

Keywords

Examples

			a(10) counts these 3 partitions:  541, 532, 4321.
		

Crossrefs

Programs

  • 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 *)

Formula

a(n) + A240850(n) = A000009(n) for n >= 0.
Showing 1-1 of 1 results.