[go: up one dir, main page]

login
Revision History for A318684 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Number of ways to split a strict integer partition of n into consecutive subsequences with strictly decreasing sums.
(history; published version)
#14 by Susanna Cuyler at Sat Sep 29 12:57:30 EDT 2018
STATUS

proposed

approved

#13 by Gus Wiseman at Sat Sep 29 09:24:26 EDT 2018
STATUS

editing

proposed

#12 by Gus Wiseman at Sat Sep 29 09:23:35 EDT 2018
EXAMPLE

The a(9) = 20 wayssplit partitions:

#11 by Gus Wiseman at Sat Sep 29 05:05:31 EDT 2018
#10 by Gus Wiseman at Sat Sep 29 05:01:33 EDT 2018
NAME

allocated for Gus WisemanNumber of ways to split a strict integer partition of n into consecutive subsequences with strictly decreasing sums.

DATA

1, 1, 1, 3, 3, 5, 8, 11, 14, 20, 28, 35, 48, 61, 79, 105, 129, 162, 208, 257, 318, 404, 489, 600, 732, 896, 1075, 1315, 1576, 1895, 2272, 2715, 3217, 3851, 4537, 5377, 6353, 7484, 8765, 10314, 12044, 14079, 16420, 19114, 22184, 25818, 29840, 34528, 39903, 46030

OFFSET

0,4

EXAMPLE

The a(9) = 20 ways:

(9)

(81) (8)(1)

(72) (7)(2)

(63) (6)(3)

(54) (5)(4)

(432) (43)(2) (4)(3)(2)

(621) (62)(1) (6)(2)(1) (6)(21)

(531) (53)(1) (5)(3)(1) (5)(31)

MATHEMATICA

comps[q_]:=Table[Table[Take[q, {Total[Take[c, i-1]]+1, Total[Take[c, i]]}], {i, Length[c]}], {c, Join@@Permutations/@IntegerPartitions[Length[q]]}];

Table[Sum[Length[Select[comps[y], OrderedQ[Total/@#, Greater]&]], {y, Select[IntegerPartitions[n], UnsameQ@@#&]}], {n, 30}]

KEYWORD

allocated

nonn

AUTHOR

Gus Wiseman, Sep 29 2018

STATUS

approved

editing

#9 by Gus Wiseman at Sat Sep 29 05:01:33 EDT 2018
NAME

allocated for Gus Wiseman

KEYWORD

recycled

allocated

#8 by N. J. A. Sloane at Fri Sep 28 23:06:49 EDT 2018
STATUS

editing

approved

#7 by N. J. A. Sloane at Fri Sep 28 23:06:30 EDT 2018
NAME

Triangle read by rows: T(0,0) = 1; T(n,k) = - T(n-1,k) + 2 T(n-5,k-1) for k = 0..floor(n/5); T(n,k)=0 for n or k < 0.

DATA

1, -1, 1, -1, 1, -1, 2, 1, -4, -1, 6, 1, -8, -1, 10, 1, -12, 4, -1, 14, -12, 1, -16, 24, -1, 18, -40, 1, -20, 60, -1, 22, -84, 8, 1, -24, 112, -32, -1, 26, -144, 80, 1, -28, 180, -160, -1, 30, -220, 280, 1, -32, 264, -448, 16

OFFSET

0,7

COMMENTS

The numbers in rows of the triangle are along "fourth layer" skew diagonals pointing top-left in center-justified triangle given in A065109 ((2-x)^n) and along "fourth layer" skew diagonals pointing top-right in center-justified triangle given in A303872 ((-1+2x)^n), see links. (Note: First layer skew diagonals in center-justified triangles of coefficients in expansions of (2-x)^n and (-1+2x)^n are given in A133156 (coefficients of Chebyshev polynomials of the second kind) and A305098 respectively.) The coefficients in the expansion of 1/(1+x-2x^5) are given by the sequence generated by the row sums. The row sums give A317509.

REFERENCES

Shara Lalo and Zagros Lalo, Polynomial Expansion Theorems and Number Triangles, Zana Publishing, 2018, ISBN: 978-1-9995914-0-3.

LINKS

Shara Lalo, <a href="/A318684/a318684.pdf">Fourth layer skew diagonals in center-justified triangle of coefficients in expansion of (2 - x)^n</a>

Shara Lalo, <a href="/A318684/a318684_1.pdf">Fourth layer skew diagonals in center-justified triangle of coefficients in expansion of (-1 + 2x)^n</a>

FORMULA

T(n,k) = (-1)^(n - 5*k) * 2^k / ((n - 5*k)! k!) * (n - 4*k)! where n >= 0 and 0 <= k <= floor(n/5).

EXAMPLE

Triangle begins:

1;

-1;

1;

-1;

1;

-1, 2;

1, -4;

-1, 6;

1, -8;

-1, 10;

1, -12, 4;

-1, 14, -12;

1, -16, 24;

-1, 18, -40;

1, -20, 60;

-1, 22, -84, 8;

1, -24, 112, -32;

-1, 26, -144, 80;

1, -28, 180, -160;

-1, 30, -220, 280;

MATHEMATICA

t[n_, k_] := t[n, k] = (-1)^(n - 5 k) * (2)^k/((n - 5 k)! k!) * (n - 4 k)!; Table[t[n, k], {n, 0, 20}, {k, 0, Floor[n/5]} ] // Flatten.

t[0, 0] = 1; t[n_, k_] := t[n, k] = If[n < 0 || k < 0, 0, - t[n - 1, k] + 2 t[n - 5, k - 1]]; Table[t[n, k], {n, 0, 20}, {k, 0, Floor[n/5]}] // Flatten.

CROSSREFS

Row sums give A317509.

Cf. A065109, A303872.

Cf. A133156, A305098.

KEYWORD

sign

recycled

AUTHOR

Shara Lalo, Sep 04 2018

STATUS

proposed

editing

Discussion
Fri Sep 28
23:06
N. J. A. Sloane: A318775 is better
#6 by Jon E. Schoenfield at Tue Sep 04 22:56:27 EDT 2018
STATUS

editing

proposed

#5 by Jon E. Schoenfield at Tue Sep 04 22:56:24 EDT 2018
NAME

Triangle read by rows: T(0,0) = 1; T(n,k) = - T(n-1,k) + 2 T(n-5,k-1) for k = 0,1..floor(n/5); T(n,k)=0 for n or k < 0.

COMMENTS

The numbers in rows of the triangle are along "fourth layer" skew diagonals pointing top-left in center-justified triangle given in A065109 ((2-x)^n) and along "fourth layer" skew diagonals pointing top-right in center-justified triangle given in A303872 ((-1+2x)^n), see links. (Note: First layer skew diagonals in center-justified triangles of coefficients in expansions of (2-x)^n and (-1+2x)^n are given in A133156 (coefficients of Chebyshev polynomials of the second kind) and A305098 respectively). ) The coefficients in the expansion of 1/(1+x-2x^5) are given by the sequence generated by the row sums. The row sums give A317509.

FORMULA

T(n,k) = (-1)^(n - 5 *k) * (2)^k / ((n - 5 *k)! k!) * (n - 4 *k)! where n is a nonnegative integer >= 0 and 0 <= k <= 0,1..floor(n/5).

EXAMPLE

1;

-1;

1;

-1;

1;

-1, 2;

1, -4;

-1, 6;

1, -8;

-1, 10;

1, -12, 4;

-1, 14, -12;

1, -16, 24;

-1, 18, -40;

1, -20, 60;

-1, 22, -84, 8;

1, -24, 112, -32;

-1, 26, -144, 80;

1, -28, 180, -160;

-1, 30, -220, 280;

STATUS

proposed

editing