A305123 -id:A305123 - cp's OEIS frontend

A067567 Odd numbers with an odd number of partitions.

1, 3, 5, 7, 13, 17, 23, 29, 33, 35, 37, 39, 41, 43, 49, 51, 53, 61, 63, 67, 69, 71, 73, 77, 81, 83, 85, 87, 89, 91, 93, 95, 99, 105, 107, 111, 115, 119, 121, 123, 127, 139, 143, 145, 155, 157, 159, 161, 165, 169, 173, 177, 181, 183, 185, 189, 193, 195, 199

Offset: 1

Naohiro Nomoto, Jan 30 2002

The original definition was: Numbers n such that A066897(n) is an odd number.
The sequence defined by b(n) = (n/2)*A281708(n) = Sum_{k=1..n} k^3 * p(k) * p(n-k) of Peter Bala appears to have the property that b(n)/n is a positive integer if n is odd, and b(2*n)/n is a positive integer which is odd iff n is a member of this sequence. - Michael Somos, Jan 28 2017
From Peter Bala, Jan 10 2025: (Start)
We generalize the above conjecture as follows.
Define b_m(n) = Sum_{k = 1..n} k^(2*m+1) * p(k) * p(n-k). Then for m >= 1,
i) for odd n, b_m(n)/n is an integer
ii) b(2*n)/n is an integer, which is odd iff n is a term of this sequence.
Cf. A067589.
We further conjecture that A305123(n) is odd iff n is a term of this sequence. (End)

			7 is in the sequence because the number of partitions of 7 is equal to 15 and both 7 and 15 are odd numbers. - _Omar E. Pol_, Mar 18 2012

Vincenzo Librandi, Table of n, a(n) for n = 1..1000

Cf. A000041, A066897, A067589, A163096, A163097, A194798, A209920, A281708, A305123.

# We conjecture that the following program produces the sequence
with(combinat):
b := n -> add(k^3*numbpart(k)*numbpart(n-k), k = 1..n):
c := n -> 2( b(n)/n - floor(b(n)/n) ):
for n from 1 to 400 do
  if c(n) = 1 then print(n/2) end if
end do;
# Peter Bala, Jan 26 2017

Select[Range[1, 200, 2], OddQ[PartitionsP[#]] &] (* T. D. Noe, Mar 18 2012 *)

isok(n) = (n % 2) && (numbpart(n) % 2); \\ Michel Marcus, Jan 26 2017

New name and more terms from Omar E. Pol, Mar 18 2012

A209423 Difference between the number of odd parts and the number of even parts in all the partitions of n.

Original entry on oeis.org

1, 1, 4, 4, 10, 13, 24, 30, 52, 68, 105, 137, 202, 264, 376, 485, 669, 864, 1162, 1486, 1968, 2501, 3256, 4110, 5285, 6630, 8434, 10511, 13241, 16417, 20505, 25273, 31344, 38438, 47346, 57782, 70746, 85947, 104663, 126594, 153386, 184793, 222865, 267452

Offset: 1

Clark Kimberling, Mar 08 2012

nonn

a(n) = number of parts of odd multiplicity (each counted only once) in all partitions of n. Example: a(5) = 10 because we have [5'],[4',1'],[3',2'], [3',1,1],[2,2,1'],[2',1',1,1], and [1',1,1,1,1] (the 10 counted parts are marked). - Emeric Deutsch, Feb 08 2016

			The partitions of 5 are [5], [4,1], [3,2], [3,1,1], [2,2,1], [2,1,1,1], and [1,1,1,1,1], a total of 15 odd parts and 5 even parts, so that a(5)=10.

Vaclav Kotesovec, Table of n, a(n) for n = 1..10000 (terms 1..1000 from Alois P. Heinz)

Cf. A066897, A066898, A000041, A240009, A264398.

b:= proc(n, i) option remember; local m, f, g;
      m:= irem(i, 2);
      if n=0 then [1, 0, 0]
    elif i<1 then [0, 0, 0]
    else f:= b(n, i-1); g:= `if`(i>n, [0$3], b(n-i, i));
         [f[1]+g[1], f[2]+g[2]+m*g[1], f[3]+g[3]+(1-m)*g[1]]
      fi
    end:
a:= n-> b(n, n)[2] -b(n, n)[3]:
seq(a(n), n=1..50);  # Alois P. Heinz, Jul 09 2012
g := add(x^j/(1+x^j), j = 1 .. 80)/mul(1-x^j, j = 1 .. 80): gser := series(g, x = 0, 50): seq(coeff(gser, x, n), n = 0 .. 45); # Emeric Deutsch, Feb 08 2016

f[n_, i_] := Count[Flatten[IntegerPartitions[n]], i]
o[n_] := Sum[f[n, i], {i, 1, n, 2}]
e[n_] := Sum[f[n, i], {i, 2, n, 2}]
Table[o[n], {n, 1, 45}]  (* A066897 *)
Table[e[n], {n, 1, 45}]  (* A066898 *)
%% - %                   (* A209423 *)
b[n_, i_] := b[n, i] = Module[{m, f, g}, m = Mod[i, 2]; If[n==0, {1, 0, 0}, If[i<1, {0, 0, 0}, f = b[n, i-1]; g = If[i>n, {0, 0, 0}, b[n-i, i]]; {f[[1]] + g[[1]], f[[2]] + g[[2]] + m*g[[1]], f[[3]] + g[[3]] + (1-m)* g[[1]]}]]]; a[n_] := b[n, n][[2]] - b[n, n][[3]]; Table[a[n], {n, 1, 50}] (* Jean-François Alcover, Nov 16 2015, after Alois P. Heinz *)

a(n) = A066897(n) - A066898(n) = A206563(n,1) - A206563(n,2). - Omar E. Pol, Mar 08 2012
G.f.: Sum_{j>0} x^j/(1+x^j)/Product_{k>0}(1 - x^k). - Emeric Deutsch, Feb 08 2016
a(n) = Sum_{i=1..n} (-1)^(i + 1)*A181187(n, i). - John M. Campbell, Mar 18 2018
a(n) ~ log(2) * exp(Pi*sqrt(2*n/3)) / (2^(3/2) * Pi * sqrt(n)). - Vaclav Kotesovec, May 25 2018
For n > 0, a(n) = A305121(n) + A305123(n). - Vaclav Kotesovec, May 26 2018
a(n) = Sum_{k=-floor(n/2)+(n mod 2)..n} k * A240009(n,k). - Alois P. Heinz, Oct 23 2018
a(n) = Sum_{k>0} k * A264398(n,k). - Alois P. Heinz, Aug 05 2020

A116676 Number of odd parts in all partitions of n into distinct parts.

Original entry on oeis.org

0, 1, 0, 2, 2, 3, 4, 5, 8, 10, 14, 16, 22, 26, 34, 43, 54, 64, 80, 96, 116, 142, 170, 202, 242, 288, 340, 404, 474, 556, 652, 762, 886, 1034, 1198, 1389, 1606, 1852, 2132, 2454, 2814, 3224, 3690, 4214, 4804, 5478, 6228, 7072, 8028, 9094, 10290, 11635, 13134

Offset: 0

Emeric Deutsch, Feb 22 2006

nonn

a(n) = Sum(k*A116675(n,k), k>=0).

			a(9) = 10 because in the partitions of 9 into distinct parts, namely, [9], [81], [72], [6,3], [6,2,1], [5,4], [5,3,1] and [4,3,2], we have a total of 10 odd parts.

Vaclav Kotesovec, Table of n, a(n) for n = 0..10000 (terms 0..1000 from Alois P. Heinz)

Cf. A116675, A305123, A305124.

Cf. A305082, A015723, A090867, A116680, A067588.

f:=product(1+x^j,j=1..64)*sum(x^(2*j-1)/(1+x^(2*j-1)),j=1..35): fser:=series(f,x=0,60): seq(coeff(fser,x,n),n=0..56);
# second Maple program:
b:= proc(n, i) option remember; local f, g;
      if n=0 then [1, 0] elif i<1 then [0, 0]
    else f:=b(n, i-1); g:=`if`(i>n, [0, 0], b(n-i, min(n-i, i-1)));
         [f[1]+g[1], f[2]+g[2] +irem(i, 2)*g[1]]
      fi
    end:
a:= n-> b(n, n)[2]:
seq(a(n), n=0..60);  # Alois P. Heinz, Nov 21 2012

b[n_, i_] := b[n, i] = Module[{f, g}, Which [n == 0, {1, 0}, i<1 , {0, 0}, True, f = b[n, i-1]; g = If[i>n, {0, 0}, b[n-i, Min[n-i, i-1]]]; {f[[1]] + g[[1]],       f[[2]] + g[[2]] + Mod[i, 2]*g[[1]]}]]; a[n_] := b[n, n][[2]]; Table [a[n], {n, 0, 60}] (* Jean-François Alcover, May 22 2015, after Alois P. Heinz *)

G.f.: product(1+x^j, j=1..infinity)*sum(x^(2j-1)/(1+x^(2j-1)), j=1..infinity).
For n > 0, a(n) = A015723(n) - A116680(n). - Vaclav Kotesovec, May 26 2018
a(n) ~ 3^(1/4) * log(2) * exp(Pi*sqrt(n/3)) / (4*Pi*n^(1/4)). - Vaclav Kotesovec, May 26 2018

A305121 G.f.: Sum_{k>=1} x^(2k)/(1+x^(2k)) * Product_{k>=1} 1/(1-x^k).

Original entry on oeis.org

0, 0, 1, 1, 2, 3, 7, 9, 14, 20, 32, 43, 63, 85, 122, 162, 221, 292, 396, 514, 680, 878, 1147, 1465, 1886, 2391, 3050, 3836, 4841, 6048, 7579, 9403, 11685, 14419, 17806, 21845, 26810, 32725, 39947, 48528, 58926, 71267, 86151, 103750, 124860, 149791, 179551

Offset: 0

Vaclav Kotesovec, May 26 2018

nonn

Vaclav Kotesovec, Table of n, a(n) for n = 0..10000

Cf. A006128, A209423, A066898, A066897, A305123.

Cf. A116680, A305122.

nmax = 60; CoefficientList[Series[Sum[x^(2*k)/(1+x^(2*k)), {k, 1, nmax}] * Product[1/(1-x^k), {k, 1, nmax}], {x, 0, nmax}], x]

For n > 0, a(n) = A209423(n) - A305123(n).

a(n) ~ log(2) * exp(Pi*sqrt(2*n/3)) / (2^(5/2)*Pi*sqrt(n)).

A305124 G.f.: Sum_{k>=1} x^(2k-1)/(1+x^(2k-1)) * Product_{k>=1} (1+x^k)/(1-x^k).

Original entry on oeis.org

0, 1, 1, 4, 7, 14, 24, 42, 69, 113, 178, 276, 420, 630, 930, 1360, 1963, 2804, 3969, 5568, 7746, 10700, 14672, 19986, 27060, 36423, 48754, 64928, 86038, 113478, 149012, 194842, 253737, 329172, 425452, 547952, 703343, 899858, 1147680, 1459364, 1850310, 2339432

Offset: 0

Vaclav Kotesovec, May 26 2018

nonn

Convolution of A305123 and A000009.

Vaclav Kotesovec, Table of n, a(n) for n = 0..10000

Cf. A305102, A305101, A305104, A305122, A305105.

Cf. A116676, A305123.

nmax = 50; CoefficientList[Series[Sum[x^(2*k-1)/(1+x^(2*k-1)), {k, 1, nmax}] * Product[(1+x^k)/(1-x^k), {k, 1, nmax}], {x, 0, nmax}], x]

a(n) = A305101(n) - A305122(n).

a(n) ~ exp(sqrt(n)*Pi) * log(2) / (8*Pi*sqrt(n)).

cp's OEIS Frontend

A067567 Odd numbers with an odd number of partitions.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Extensions

A209423 Difference between the number of odd parts and the number of even parts in all the partitions of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A116676 Number of odd parts in all partitions of n into distinct parts.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A305121 G.f.: Sum_{k>=1} x^(2*k)/(1+x^(2*k)) * Product_{k>=1} 1/(1-x^k).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Formula

A305124 G.f.: Sum_{k>=1} x^(2*k-1)/(1+x^(2*k-1)) * Product_{k>=1} (1+x^k)/(1-x^k).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A305121 G.f.: Sum_{k>=1} x^(2k)/(1+x^(2k)) * Product_{k>=1} 1/(1-x^k).

A305124 G.f.: Sum_{k>=1} x^(2k-1)/(1+x^(2k-1)) * Product_{k>=1} (1+x^k)/(1-x^k).