proposed

approved

editing

proposed

Also odd-length partitions of 2n+1 with exactly one odd part.

ats[y_]:=Sum[(-1)^(i-1)*y[[i]], {i, Length[y]}]; Table[Length[Select[IntegerPartitions[n], OddQ[MaxLength[#]]&&atsCount[#, _?OddQ]==1&]], {n, 1, 30, 2}] (* Gus Wiseman, Jun 26 2021 *)

proposed

editing

editing

proposed

The case of strict partitions is A000035.

The version for greatest part even instead of odd greatest part is A306145.

Also the number of integer partitions of 2n+1 with odd greatest part and alternating sum 1, where the alternating sum of a partition (y_1,...,y_k) is Sum_i (-1)^(k-i-1) y_i, which is equal to (-1)^(k-1) times the number of odd parts in the conjugate partition. For example, the a(0) = 1 through a(6) = 15 partitions are:

Cf. A000097, A006330, A027193, A030229, A067659, ~A087447, A236559, A236914, A239829, A239830, A318156, A338907, A344611.

From Gus Wiseman, Jun 26 2021: (Start)

Also the number of integer partitions of 2n+1 with odd greatest part and alternating sum 1, where the alternating sum of a partition (y_1,...,y_k) is Sum_i (-1)^(k-i) y_i, which is equal to (-1)^(k-1) times the number of odd parts in the conjugate partition. For example, the a(0) = 1 through a(6) = 15 partitions are:

1 111 32 331 54 551 76

11111 3211 3222 3332 5422

1111111 3321 5411 5521

33111 33221 33331

321111 322211 55111

111111111 332111 322222

3311111 332221

32111111 333211

11111111111 541111

3322111

32221111

33211111

331111111

3211111111

1111111111111

(End)

ats[y_]:=Sum[(-1)^(i-1)*y[[i]], {i, Length[y]}]; Table[Length[Select[IntegerPartitions[n], OddQ[Max[#]]&&ats[#]==1&]], {n, 1, 30, 2}] (* Gus Wiseman, Jun 26 2021 *)

The case of strict partitions is A000035.

First differences are A027187.

The version for greatest part even instead of odd is A306145.

A000041 counts partitions of 2n with alternating sum 0, ranked by A000290.

A000070 counts partitions with alternating sum 1.

A067661 counts strict partitions of even length.

A103919 counts partitions by sum and alternating sum (reverse: A344612).

A344610 counts partitions by sum and positive reverse-alternating sum.

Cf. A000070, A027187, A306145A000097, A006330, A027193, A030229, A067659, ~A087447, A236559, A236914, A239829, A239830, A318156, A338907, A344611.

approved

editing

proposed

approved

editing

proposed

a(n) ~ exp(Pi*sqrt(2*n/3)) / (2^(5/2)*Pi*sqrt(n)). - Vaclav Kotesovec, Aug 20 2018

proposed

editing