A298311 -id:A298311 - cp's OEIS frontend

A357638 Triangle read by rows where T(n,k) is the number of integer partitions of n with skew-alternating sum k, where k ranges from -n to n in steps of 2.

1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 3, 1, 1, 0, 0, 1, 4, 1, 1, 0, 0, 1, 4, 4, 1, 1, 0, 0, 0, 4, 5, 4, 1, 1, 0, 0, 0, 1, 10, 5, 4, 1, 1, 0, 0, 0, 1, 5, 13, 5, 4, 1, 1, 0, 0, 0, 0, 4, 13, 14, 5, 4, 1, 1, 0, 0, 0, 0, 1, 13, 17, 14, 5, 4, 1, 1

Offset: 0

Gus Wiseman, Oct 10 2022

We define the skew-alternating sum of a sequence (A, B, C, D, E, F, G, ...) to be A - B - C + D + E - F - G + ....

			Triangle begins:
  1
  0  1
  0  1  1
  0  1  1  1
  0  0  3  1  1
  0  0  1  4  1  1
  0  0  1  4  4  1  1
  0  0  0  4  5  4  1  1
  0  0  0  1 10  5  4  1  1
  0  0  0  1  5 13  5  4  1  1
  0  0  0  0  4 13 14  5  4  1  1
  0  0  0  0  1 13 17 14  5  4  1  1
  0  0  0  0  1  5 28 18 14  5  4  1  1
Row n = 7 counts the following partitions:
  .  .  .  (322)      (43)      (52)     (61)  (7)
           (331)      (421)     (511)
           (2221)     (3211)    (4111)
           (1111111)  (22111)   (31111)
                      (211111)

Row sums are A000041.
Number of nonzero entries in row n appears to be A004396(n+1).
First nonzero entry of each row appears to converge to A146325.
The central column is A035544, half A035363.
Column sums appear to be A298311.
For original alternating sum we have A344651, ordered A097805.
The half-alternating version is A357637.
The ordered version (compositions) is A357646, half A357645.
The reverse version is A357705, half A357704.
A351005 = alternately equal and unequal partitions, compositions A357643.
A351006 = alternately unequal and equal partitions, compositions A357644.
A357621 gives half-alternating sum of standard compositions, skew A357623.
A357629 gives half-alternating sum of prime indices, skew A357630.
A357633 gives half-alternating sum of Heinz partition, skew  A357634.
Cf. A035594, A053251, A357136, A357189, A357486, A357487, A357488, A357624, A357631, A357632, A357636.

skats[f_]:=Sum[f[[i]]*(-1)^(1+Ceiling[(i+1)/2]),{i,Length[f]}];
Table[Length[Select[IntegerPartitions[n],skats[#]==k&]],{n,0,12},{k,-n,n,2}]

Conjecture: The columns are palindromes with sums A298311.

A035544 Number of partitions of n with equal number of parts congruent to each of 1 and 3 (mod 4).

Original entry on oeis.org

1, 0, 1, 0, 3, 0, 4, 0, 10, 0, 13, 0, 28, 0, 37, 0, 72, 0, 96, 0, 172, 0, 230, 0, 391, 0, 522, 0, 846, 0, 1129, 0, 1766, 0, 2348, 0, 3564, 0, 4722, 0, 6992, 0, 9226, 0, 13371, 0, 17568, 0, 25006, 0, 32708, 0, 45817, 0, 59668, 0, 82430, 0, 106874, 0, 145830, 0, 188260, 0

Offset: 0

Olivier Gérard

nonn

From Gus Wiseman, Oct 12 2022: (Start)
Also the number of integer partitions of n whose skew-alternating sum is 0, where we define the skew-alternating sum of a sequence (A, B, C, D, E, F, G, ...) to be A - B - C + D + E - F - G + ... These are the conjugates of the partitions described in the name. For example, the a(0) = 1 through a(8) = 10 partitions are:
  ()  .  (11)  .  (22)    .  (33)      .  (44)
                  (211)      (321)        (422)
                  (1111)     (2211)       (431)
                             (111111)     (2222)
                                          (3221)
                                          (3311)
                                          (22211)
                                          (221111)
                                          (2111111)
                                          (11111111)
The ordered version (compositions) is A138364
These partitions are ranked by A357636, reverse A357632.
The reverse version is A357640 (aerated).
Cf. A357623, A357629, A357630, A357634, A357646, A357705.
(End)

			From _Gus Wiseman_, Oct 12 2022: (Start)
The a(0) = 1 through a(8) = 10 partitions:
  ()  .  (2)  .  (4)   .  (6)    .  (8)
                 (22)     (42)      (44)
                 (31)     (222)     (53)
                          (321)     (62)
                                    (71)
                                    (422)
                                    (431)
                                    (2222)
                                    (3221)
                                    (3311)
(End)

The case with at least one odd part is A035550.
Removing zeros gives A035594.
Central column k=0 of A357638.
These partitions are ranked by A357707.
A000041 counts integer partitions.
A344651 counts partitions by alternating sum, ordered A097805.
Cf. A035363, A053251, A298311, A357189, A357487, A357488.

skats[f_]:=Sum[f[[i]]*(-1)^(1+Ceiling[(i+1)/2]),{i,Length[f]}];
Table[Length[Select[IntegerPartitions[n],skats[#]==0&]],{n,0,30}] (* Gus Wiseman,Oct 12 2022 *)

More terms from David W. Wilson

A160461 Coefficients in the expansion of C/B^2, in Watson's notation of page 106.

Original entry on oeis.org

1, 2, 5, 10, 20, 35, 63, 105, 175, 280, 444, 685, 1050, 1575, 2345, 3439, 5005, 7195, 10275, 14525, 20405, 28428, 39375, 54150, 74080, 100715, 136265, 183365, 245645, 327485, 434810, 574790, 756965, 992950, 1297940, 1690500, 2194642, 2839695, 3663225, 4711160

Offset: 0

N. J. A. Sloane, Nov 13 2009

			x^3+2*x^27+5*x^51+10*x^75+20*x^99+35*x^123+63*x^147+...

Seiichi Manyama, Table of n, a(n) for n = 0..1000
Watson, G. N., Ramanujans Vermutung ueber Zerfaellungsanzahlen. J. Reine Angew. Math. (Crelle), 179 (1938), 97-128.

Cf. Product_{n>=1} (1 - x^(5*n))^k/(1 - x^n)^(k + 1): this sequence (k=1), A160462 (k=2), A160463 (k=3), A160506 (k=4), A071734 (k=5), A160460 (k=6), A160521 (k=7), A278555 (k=12), A278556 (k=18), A278557 (k=24), A278558 (k=30).

Cf. A000041, A015128, A278690, A298311.

nmax = 50; CoefficientList[Series[Product[(1 - x^(5*k))/(1 - x^k)^2, {k, 1, nmax}], {x, 0, nmax}], x] (* Vaclav Kotesovec, Nov 26 2016 *)

See Maple code in A160458 for formula.
a(n) ~ sqrt(3)*exp(sqrt(6*n/5)*Pi)/(20*n). - Vaclav Kotesovec, Nov 26 2016
G.f.: 1/Product_{n > = 1} ( 1 - x^(n/gcd(n,k)) ) for k = 5. Cf. A000041 (k = 1), A015128 (k = 2), A278690 (k = 3) and A298311 (k = 4). - Peter Bala, Nov 17 2020

A357705 Triangle read by rows where T(n,k) is the number of reversed integer partitions of n with skew-alternating sum k, where k ranges from -n to n in steps of 2.

Original entry on oeis.org

1, 0, 1, 0, 1, 1, 0, 2, 0, 1, 0, 2, 2, 0, 1, 0, 3, 1, 2, 0, 1, 0, 3, 2, 3, 2, 0, 1, 0, 4, 2, 4, 1, 3, 0, 1, 0, 4, 3, 3, 6, 2, 3, 0, 1, 0, 5, 3, 5, 3, 7, 2, 4, 0, 1, 0, 5, 4, 5, 4, 9, 7, 3, 4, 0, 1, 0, 6, 4, 7, 3, 12, 5, 10, 3, 5, 0, 1

Offset: 0

Gus Wiseman, Oct 10 2022

We define the skew-alternating sum of a sequence (A, B, C, D, E, F, G, ...) to be A - B - C + D + E - F - G + ...

			Triangle begins:
  1
  0  1
  0  1  1
  0  2  0  1
  0  2  2  0  1
  0  3  1  2  0  1
  0  3  2  3  2  0  1
  0  4  2  4  1  3  0  1
  0  4  3  3  6  2  3  0  1
  0  5  3  5  3  7  2  4  0  1
  0  5  4  5  4  9  7  3  4  0  1
  0  6  4  7  3 12  5 10  3  5  0  1
  0  6  5  7  5 10 16  7 11  4  5  0  1
  0  7  5  9  5 14 11 18  7 14  4  6  0  1
Row n = 7 counts the following reversed partitions:
  .  (16)   (25)   (34)       (1123)  (1114)   .  (7)
     (115)  (223)  (1222)             (11113)
     (124)         (111112)           (11122)
     (133)         (1111111)

Row sums are A000041.
First nonzero entry of each row is A004526.
The central column is A357640, half A357639.
For original alternating sum we have A344651, ordered A097805.
The half-alternating version is A357704.
The ordered non-reverse version (compositions) is A357646, half A357645.
The non-reverse version is A357638, half A357637.
A351005 = alternately equal and unequal partitions, compositions A357643.
A351006 = alternately unequal and equal partitions, compositions A357644.
A357621 gives half-alternating sum of standard compositions, skew A357623.
A357629 gives half-alternating sum of prime indices, skew A357630.
A357633 gives half-alternating sum of Heinz partition, skew  A357634.
Cf. A035363, A035594, A053251, A298311, A357136, A357189, A357487, A357488, A357624, A357631, A357632, A357636.

skats[f_]:=Sum[f[[i]]*(-1)^(1+Ceiling[(i+1)/2]),{i,Length[f]}];
Table[Length[Select[Reverse/@IntegerPartitions[n],skats[#]==k&]],{n,0,11},{k,-n,n,2}]

A278690 Expansion of Product_{n>=1} (1 - x^(3*n))/(1 - x^n)^2 in powers of x.

Original entry on oeis.org

1, 2, 5, 9, 18, 31, 54, 88, 144, 225, 351, 531, 800, 1179, 1728, 2492, 3573, 5058, 7119, 9918, 13743, 18882, 25810, 35028, 47313, 63513, 84883, 112833, 149373, 196803, 258309, 337590, 439650, 570357, 737496, 950270, 1220688, 1563021, 1995642, 2540466, 3225386

Offset: 0

Seiichi Manyama, Nov 26 2016

			G.f. = 1 + 2*x + 5*x^2 + 9*x^3 + 18*x^4 + 31*x^5 + 54*x^6 + ...
G.f. = q + 2*q^25 + 5*q^49 + 9*q^73 + 18*q^97 + 31*q^121 + 54*q^145 + ... - _Michael Somos_, Nov 25 2019

Seiichi Manyama, Table of n, a(n) for n = 0..1000

Cf. Product_{n>=1} (1 - x^(3*n))/(1 - x^n)^k: A000726 (k=1), this sequence (k=2), A273845 (k=3), A182819 (k=4).
Cf. Product_{n>=1} (1 - x^(k*n))/(1 - x^n)^2: A000041 (k=1), A015128 (k=2), this sequence (k=3), A160461 (k=5).
Cf. A298311.

nmax = 50; CoefficientList[Series[Product[(1 - x^(3*k))/(1 - x^k)^2, {k, 1, nmax}], {x, 0, nmax}], x] (* Vaclav Kotesovec, Nov 26 2016 *)
a[ n_] := SeriesCoefficient[ QPochhammer[ x^3] / QPochhammer[ x]^2, {x, 0, n}]; (* Michael Somos, Nov 25 2019 *)

{a(n) = my(A); if( n<0, 0, A = x * O(x^n); polcoeff( eta(x^3 + A) / eta(x + A)^2, n))}; /* Michael Somos, Nov 25 2019 */

G.f.: Product_{n>=1} (1 - x^(3*n))/(1 - x^n)^2.
a(n) ~ sqrt(5/3)*exp(sqrt(10*n)*Pi/3)/(12*n). - Vaclav Kotesovec, Nov 26 2016
Expansion of q^(-1/24) * eta(q^3) / eta(q)^2 in powers of q. - Michael Somos, Nov 25 2019
G.f.: 1/Product_{n > = 1} ( 1 - x^(n/gcd(n,k)) ) for k = 3. Cf. A000041 (k = 1), A015128 (k = 2), A298311 (k = 4) and A160461 (k = 5). - Peter Bala, Nov 17 2020

A357707 Numbers whose prime indices have equal number of parts congruent to each of 1 and 3 (mod 4).

Original entry on oeis.org

1, 3, 7, 9, 10, 13, 19, 21, 27, 29, 30, 34, 37, 39, 43, 49, 53, 55, 57, 61, 62, 63, 70, 71, 79, 81, 87, 89, 90, 91, 94, 100, 101, 102, 107, 111, 113, 115, 117, 129, 130, 131, 133, 134, 139, 147, 151, 159, 163, 165, 166, 169, 171, 173, 181, 183, 186, 187, 189

Offset: 1

Gus Wiseman, Oct 12 2022

nonn

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.

			The terms together with their prime indices begin:
     1: {}
     3: {2}
     7: {4}
     9: {2,2}
    10: {1,3}
    13: {6}
    19: {8}
    21: {2,4}
    27: {2,2,2}
    29: {10}
    30: {1,2,3}

These partitions are counted by A035544.
Includes A066207 = products of primes of even index.
The conjugate partitions are ranked by A357636, reverse A357632.
The conjugate reverse version is A357640 (aerated).
A056239 adds up prime indices, row sums of A112798.
A316524 gives alternating sum of prime indices, reverse A344616.
A344651 counts partitions by alternating sum, ordered A097805.
A357705 counts reversed partitions by skew-alternating sum, half A357704.
Cf. A035363, A035550, A035594, A053251, A298311, A357486, A357623, A357638.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[100],Count[primeMS[#],?(Mod[#,4]==1&)]==Count[primeMS[#],?(Mod[#,4]==3&)]&]

cp's OEIS Frontend

A357638 Triangle read by rows where T(n,k) is the number of integer partitions of n with skew-alternating sum k, where k ranges from -n to n in steps of 2.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A035544 Number of partitions of n with equal number of parts congruent to each of 1 and 3 (mod 4).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Extensions

A160461 Coefficients in the expansion of C/B^2, in Watson's notation of page 106.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A357705 Triangle read by rows where T(n,k) is the number of reversed integer partitions of n with skew-alternating sum k, where k ranges from -n to n in steps of 2.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A278690 Expansion of Product_{n>=1} (1 - x^(3*n))/(1 - x^n)^2 in powers of x.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A357707 Numbers whose prime indices have equal number of parts congruent to each of 1 and 3 (mod 4).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica