A239261 -id:A239261 - cp's OEIS frontend

A366850 Number of integer partitions of n whose odd parts are relatively prime.

0, 1, 1, 2, 3, 5, 7, 11, 16, 22, 32, 43, 60, 80, 110, 140, 194, 244, 327, 410, 544, 670, 883, 1081, 1401, 1708, 2195, 2651, 3382, 4069, 5129, 6157, 7708, 9194, 11438, 13599, 16788, 19911, 24432, 28858, 35229, 41507, 50359, 59201, 71489, 83776, 100731, 117784

Offset: 0

Gus Wiseman, Oct 28 2023

nonn

			The a(1) = 1 through a(8) = 16 partitions:
  (1)  (11)  (21)   (31)    (41)     (51)      (61)       (53)
             (111)  (211)   (221)    (321)     (331)      (71)
                    (1111)  (311)    (411)     (421)      (431)
                            (2111)   (2211)    (511)      (521)
                            (11111)  (3111)    (2221)     (611)
                                     (21111)   (3211)     (3221)
                                     (111111)  (4111)     (3311)
                                               (22111)    (4211)
                                               (31111)    (5111)
                                               (211111)   (22211)
                                               (1111111)  (32111)
                                                          (41111)
                                                          (221111)
                                                          (311111)
                                                          (2111111)
                                                          (11111111)

For all parts (not just odd) we have A000837, complement A018783.
The complement is counted by A366842.
These partitions have ranks A366846.
A000041 counts integer partitions, strict A000009 (also into odds).
A000740 counts relatively prime compositions.
A078374 counts relatively prime strict partitions.
A113685 counts partitions by sum of odd parts, rank statistic A366528.
A168532 counts partitions by gcd.
A239261 counts partitions with (sum of odd parts) = (sum of even parts).
Cf. A007359, A047967, A051424, A066208, A116598, A365067, A366843, A366844, A366845, A366848.

Table[Length[Select[IntegerPartitions[n],GCD@@Select[#,OddQ]==1&]],{n,0,30}]

A239259 Number of partitions of n having (sum of odd parts) < (sum of even parts).

Original entry on oeis.org

0, 0, 1, 1, 2, 2, 5, 7, 8, 11, 18, 26, 28, 40, 60, 83, 87, 120, 168, 230, 242, 331, 446, 592, 619, 821, 1083, 1407, 1496, 1940, 2511, 3220, 3393, 4347, 5520, 6976, 7399, 9338, 11732, 14627, 15508, 19314, 23999, 29654, 31519, 38907, 47835, 58555, 62090, 75942

Offset: 0

Clark Kimberling, Mar 13 2014

			a(8) counts these 8 partitions:  8, 62, 611, 44, 422, 4211, 2222, 22211.

Alois P. Heinz, Table of n, a(n) for n = 0..500

Cf. A239260, A239261, A239262, A239263, A000041.

z = 40; p[n_] := p[n] = IntegerPartitions[n]; f[t_] := f[t] = Length[t]
t1 = Table[f[Select[p[n], 2 Total[Select[#, OddQ]] < n &]], {n, z}] (* A239259 *)
t2 = Table[f[Select[p[n], 2 Total[Select[#, OddQ]] <= n &]], {n, z}] (* A239260 *)
t3 = Table[f[Select[p[n], 2 Total[Select[#, OddQ]] == n &]], {n, z}] (* A239261 *)
t4 = Table[f[Select[p[n], 2 Total[Select[#, OddQ]] > n &]], {n, z}] (* A239262 *)
t5 = Table[f[Select[p[n], 2 Total[Select[#, OddQ]] >= n &]], {n, z}] (* A239263 *)
(* Peter J. C. Moses, Mar 12 2014 *)

a(n) + A239263(n) = A000041(n).

A239260 Number of partitions of n having (sum of odd parts) <= (sum of even parts).

Original entry on oeis.org

1, 0, 1, 1, 3, 2, 5, 7, 12, 11, 18, 26, 40, 40, 60, 83, 117, 120, 168, 230, 312, 331, 446, 592, 784, 821, 1083, 1407, 1826, 1940, 2511, 3220, 4097, 4347, 5520, 6976, 8779, 9338, 11732, 14627, 18196, 19314, 23999, 29654, 36503, 38907, 47835, 58555, 71484, 75942

Offset: 0

Clark Kimberling, Mar 13 2014

			a(8) counts these 12 partitions:  8, 62, 611, 44, 431, 422, 4211, 41111, 3221, 2222, 22211, 221111.

Alois P. Heinz, Table of n, a(n) for n = 0..500

Cf. A239259, A239261, A239262, A239263, A000041.

z = 40; p[n_] := p[n] = IntegerPartitions[n]; f[t_] := f[t] = Length[t]
t1 = Table[f[Select[p[n], 2 Total[Select[#, OddQ]] < n &]], {n, z}] (* A239259 *)
t2 = Table[f[Select[p[n], 2 Total[Select[#, OddQ]] <= n &]], {n, z}] (* A239260 *)
t3 = Table[f[Select[p[n], 2 Total[Select[#, OddQ]] == n &]], {n, z}] (* A239261 *)
t4 = Table[f[Select[p[n], 2 Total[Select[#, OddQ]] > n &]], {n, z}] (* A239262 *)
t5 = Table[f[Select[p[n], 2 Total[Select[#, OddQ]] >= n &]], {n, z}] (* A239263 *)
(* Peter J. C. Moses, Mar 12 2014 *)

a(n) + A239262(n) = A000041(n).

A239262 Number of partitions of n having (sum of odd parts) > (sum of even parts).

Original entry on oeis.org

0, 1, 1, 2, 2, 5, 6, 8, 10, 19, 24, 30, 37, 61, 75, 93, 114, 177, 217, 260, 315, 461, 556, 663, 791, 1137, 1353, 1603, 1892, 2625, 3093, 3622, 4252, 5796, 6790, 7907, 9198, 12299, 14283, 16558, 19142, 25269, 29175, 33607, 38672, 50227, 57723, 66199, 75789

Offset: 0

Clark Kimberling, Mar 13 2014

			a(8) counts these 10 partitions:  71, 53, 521, 5111, 332, 3311, 32111, 311111, 2111111, 11111111.

Alois P. Heinz, Table of n, a(n) for n = 0..500

Cf. A239259, A239260, A239261, A239263, A000041.

z = 40; p[n_] := p[n] = IntegerPartitions[n]; f[t_] := f[t] = Length[t]
t1 = Table[f[Select[p[n], 2 Total[Select[#, OddQ]] < n &]], {n, z}] (* A239259 *)
t2 = Table[f[Select[p[n], 2 Total[Select[#, OddQ]] <= n &]], {n, z}] (* A239260 *)
t3 = Table[f[Select[p[n], 2 Total[Select[#, OddQ]] == n &]], {n, z}] (* A239261 *)
t4 = Table[f[Select[p[n], 2 Total[Select[#, OddQ]] > n &]], {n, z}] (* A239262 *)
t5 = Table[f[Select[p[n], 2 Total[Select[#, OddQ]] >= n &]], {n, z}] (* A239263 *)
(* Peter J. C. Moses, Mar 12 2014 *)

a(n) + A239260(n) = A000041(n).

A239263 Number of partitions of n having (sum of odd parts) >= (sum of even parts).

Original entry on oeis.org

1, 1, 1, 2, 3, 5, 6, 8, 14, 19, 24, 30, 49, 61, 75, 93, 144, 177, 217, 260, 385, 461, 556, 663, 956, 1137, 1353, 1603, 2222, 2625, 3093, 3622, 4956, 5796, 6790, 7907, 10578, 12299, 14283, 16558, 21830, 25269, 29175, 33607, 43656, 50227, 57723, 66199, 85183

Offset: 0

Clark Kimberling, Mar 13 2014

			a(8) counts these 14 partitions:  71, 53, 521, 5111, 431, 41111, 332, 3311, 3221, 32111, 311111, 221111, 2111111, 11111111.

Alois P. Heinz, Table of n, a(n) for n = 0..500

Cf. A239259, A239260, A239261, A239262, A000041.

z = 40; p[n_] := p[n] = IntegerPartitions[n]; f[t_] := f[t] = Length[t]
t1 = Table[f[Select[p[n], 2 Total[Select[#, OddQ]] < n &]], {n, z}] (* A239259 *)
t2 = Table[f[Select[p[n], 2 Total[Select[#, OddQ]] <= n &]], {n, z}] (* A239260 *)
t3 = Table[f[Select[p[n], 2 Total[Select[#, OddQ]] == n &]], {n, z}] (* A239261 *)
t4 = Table[f[Select[p[n], 2 Total[Select[#, OddQ]] > n &]], {n, z}] (* A239262 *)
t5 = Table[f[Select[p[n], 2 Total[Select[#, OddQ]] >= n &]], {n, z}] (* A239263 *)
(* Peter J. C. Moses, Mar 12 2014 *)

a(n) + A239259(n) = A000041(n).

A366748 Numbers k such that (sum of odd prime indices of k) = (sum of even prime indices of k).

Original entry on oeis.org

1, 12, 70, 90, 112, 144, 286, 325, 462, 520, 525, 594, 646, 675, 832, 840, 1045, 1080, 1326, 1334, 1344, 1666, 1672, 1728, 1900, 2142, 2145, 2294, 2465, 2622, 2695, 2754, 3040, 3432, 3465, 3509, 3526, 3900, 3944, 4186, 4255, 4312, 4455, 4845, 4864, 4900, 4982

Offset: 1

Gus Wiseman, Oct 23 2023

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: {}
    12: {1,1,2}
    70: {1,3,4}
    90: {1,2,2,3}
   112: {1,1,1,1,4}
   144: {1,1,1,1,2,2}
   286: {1,5,6}
   325: {3,3,6}
   462: {1,2,4,5}
   520: {1,1,1,3,6}
   525: {2,3,3,4}
   594: {1,2,2,2,5}
   646: {1,7,8}
   675: {2,2,2,3,3}
   832: {1,1,1,1,1,1,6}
   840: {1,1,1,2,3,4}
For example, 525 has prime indices {2,3,3,4}, and 3+3 = 2+4, so 525 is in the sequence.

For prime factors instead of indices we have A019507.
Partitions of this type are counted by A239261.
For count instead of sum we have A325698, distinct A325700.
The LHS (sum of odd prime indices) is A366528, triangle A113685.
The RHS (sum of even prime indices) is A366531, triangle A113686.
These are the positions of zeros in A366749.
A000009 counts partitions into odd parts, ranked by A066208.
A035363 counts partitions into even parts, ranked by A066207.
A112798 lists prime indices, reverse A296150, length A001222, sum A056239.
A257991 counts odd prime indices, even A257992.
A300061 lists numbers with even sum of prime indices, odd A300063.
Cf. A028260, A045931, A106529, A239241, A241638, A365067, A366533.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n], {p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[1000], Total[Select[prix[#],OddQ]]==Total[Select[prix[#],EvenQ]]&]

These are numbers k such that A346697(k) = A346698(k).

A366839 Sum of even prime factors of 2n, counted with multiplicity.

Original entry on oeis.org

2, 4, 2, 6, 2, 4, 2, 8, 2, 4, 2, 6, 2, 4, 2, 10, 2, 4, 2, 6, 2, 4, 2, 8, 2, 4, 2, 6, 2, 4, 2, 12, 2, 4, 2, 6, 2, 4, 2, 8, 2, 4, 2, 6, 2, 4, 2, 10, 2, 4, 2, 6, 2, 4, 2, 8, 2, 4, 2, 6, 2, 4, 2, 14, 2, 4, 2, 6, 2, 4, 2, 8, 2, 4, 2, 6, 2, 4, 2, 10, 2, 4, 2, 6, 2

Offset: 1

Gus Wiseman, Oct 25 2023

nonn

			The prime factors of 2*60 are {2,2,2,3,5}, of which the even factors are {2,2,2}, so a(60) = 6.

A compound version is A001414, triangle A331416.
Dividing by 2 gives A001511.
Positions of 2's are A005408.
For count instead of sum we have A007814, odd version A087436.
The partition triangle for this statistic is A116598 aerated.
For indices we have A366531, halved A366533, triangle A113686/A174713.
The odd version is A366840.
A019507 lists numbers with (even factor sum) = (odd factor sum).
A066207 lists numbers with all even prime indices, counted by A035363.
A112798 lists prime indices, reverse A296150, length A001222, sum A056239.
A162641 counts even prime exponents, odd A162642.
A239261 counts partitions with (sum of odd parts) = (sum of even parts).
A257992 counts even prime indices, odd A257991.
A366528 adds up odd prime indices, triangle A113685 (without zeros A365067).
Cf. A000720, A066208, A258117, A325698.

Table[2*Length[NestWhileList[#/2&,n,EvenQ]],{n,100}]

a(n) = 2 * valuation(n, 2) + 2; \\ Amiram Eldar, Sep 13 2024

a(n) = 2*A001511(n).
a(n) = A100006(n) - A366840(2n).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = 4. - Amiram Eldar, Sep 13 2024

A366840 Sum of odd prime factors of n, counted with multiplicity.

Original entry on oeis.org

0, 0, 3, 0, 5, 3, 7, 0, 6, 5, 11, 3, 13, 7, 8, 0, 17, 6, 19, 5, 10, 11, 23, 3, 10, 13, 9, 7, 29, 8, 31, 0, 14, 17, 12, 6, 37, 19, 16, 5, 41, 10, 43, 11, 11, 23, 47, 3, 14, 10, 20, 13, 53, 9, 16, 7, 22, 29, 59, 8, 61, 31, 13, 0, 18, 14, 67, 17, 26, 12, 71, 6

Offset: 1

Gus Wiseman, Oct 27 2023

Contains all positive integers except 1, 2, 4.

			The prime factors of 60 are {2,2,2,3,5}, of which the odd factors are {3,5}, so a(60) = 8.

The compound version is A001414, triangle A331416.
For count instead of sum we have A087436, even version A007814.
Odd-indexed terms are A100005.
Positions of odd terms are A335657, even A036349.
For prime indices we have A366528, triangle A113685 (without zeros A365067)
The even version is A366839 = 2*A001511.
The partition triangle for this statistic is A366851, even version A116598.
A019507 lists numbers with (even factor sum) = (odd factor sum).
A066207 lists numbers with all even prime indices, counted by A035363.
A112798 lists prime indices, reverse A296150, length A001222, sum A056239.
A162641 counts even prime exponents, odd A162642.
A239261 counts partitions with (sum of odd parts) = (sum of even parts).
A257992 counts even prime indices, odd A257991.
Cf. A000009, A066208, A113686, A174713, A258117, A325698, A366531, A366850.

Table[Total[Times@@@DeleteCases[If[n==1,{}, FactorInteger[n]],{2,_}]],{n,100}]

a(n) = my(f=factor(n), j=if(n%2, 1, 2)); sum(i=j, #f~, f[i,1]*f[i,2]); \\ Michel Marcus, Oct 30 2023

a(n) = A100006(n) - A366839(n).
a(2n) = a(n).
a(2n-1) = A001414(2n-1) = A100005(n).
Completely additive with a(2^e) = 0 and a(p^e) = e*p for an odd prime p. - Amiram Eldar, Nov 03 2023

A366851 Irregular triangle read by rows where T(n,k) is the number of integer partitions of n such that the sum of primes indexed by all parts greater than one is k.

Original entry on oeis.org

1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 2, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 2, 2, 2, 3, 2, 0, 2, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 2, 2, 2, 2, 1, 1, 0, 0, 1

Offset: 0

Gus Wiseman, Nov 01 2023

To illustrate the definition, the sum of primes indexed by all parts greater than one of the partition (5,2,2,1) is prime(5) + prime(2) + prime(2) = 17.

			Triangle begins:
  1
  1
  1 0 0 1
  1 0 0 1 0 1
  1 0 0 1 0 1 1 1
  1 0 0 1 0 1 1 1 1 0 0 1
  1 0 0 1 0 1 1 1 1 1 2 1 0 1
  1 0 0 1 0 1 1 1 1 1 2 2 1 1 1 0 0 1
  1 0 0 1 0 1 1 1 1 1 2 2 2 3 2 0 2 1 0 1
  1 0 0 1 0 1 1 1 1 1 2 2 2 3 3 2 2 2 2 1 1 0 0 1
  1 0 0 1 0 1 1 1 1 1 2 2 2 3 3 3 4 4 2 3 2 0 3 1 0 0 0 0 0 1
  1 0 0 1 0 1 1 1 1 1 2 2 2 3 3 3 4 5 4 4 3 3 3 2 3 0 1 0 0 1 0 1
The T(8,13) = 3 partitions are: (6,1,1), (4,2,2), (3,3,2).
The T(10,17) = 4 partitions are: (7,1,1,1), (5,2,2,1), (4,4,2), (4,3,3).

Row lengths are A055670.
Columns appear to converge to A099773.
A bisected even version is A116598 (counts partitions by number of 1's).
Counting all parts (not just > 1) gives A331416, shifted A331385.
A000041 counts integer partitions, strict A000009 (also into odds).
A113685 counts partitions by sum of odd parts, rank statistic A366528.
A330953 counts partitions with Heinz number divisible by sum of primes.
A331381 counts partitions with (product)|(sum of primes), equality A331383.
Cf. A000837, A014689, A113686, A239261, A331417, A331418, A365067, A366842.

Table[Length[Select[IntegerPartitions[n], Total[Select[Prime/@#,OddQ]]==k&]], {n,0,10}, {k,0,If[n<=1,0,Prime[n]]}]

A366841 Least positive integer whose odd prime factors sum to n, starting with n = 5.

Original entry on oeis.org

5, 9, 7, 15, 27, 21, 11, 35, 13, 33, 105, 39, 17, 65, 19, 51, 195, 57, 23, 95, 171, 69, 285, 115, 29, 161, 31, 87, 483, 93, 261, 155, 37, 217, 465, 111, 41, 185, 43, 123, 555, 129, 47, 215, 387, 141, 645, 235, 53, 329, 705, 159, 987, 265, 59, 371, 61, 177

Offset: 5

Gus Wiseman, Oct 27 2023

nonn

All terms are odd.

It seems that all composite terms not divisible by 3 form a supersequence of A292081. - Ivan N. Ianakiev, Oct 30 2023

			The terms together with their prime factors (which sum to n) begin:
    5 = 5
    9 = 3*3
    7 = 7
   15 = 3*5
   27 = 3*3*3
   21 = 3*7
   11 = 11
   35 = 5*7
   13 = 13
   33 = 3*11
  105 = 3*5*7

Michel Marcus, Table of n, a(n) for n = 5..1000

This is the odd case of A056240.
Positions of first appearances in A366840 (sum of odd prime factors).
The partition triangle for this statistic is A366851, even A116598.
A001414 adds up prime factors, triangle A331416.
A019507 lists numbers with (even factor sum) = (odd factor sum).
A027746 lists prime factors, length A001222.
A087436 counts odd prime factors, even A007814.
A366528 adds up odd prime indices, triangle A113685 (without zeros A365067).
Cf. A031368, A036349, A056239, A066208, A100005, A112798, A239261, A257991, A335657, A366839.

nn=1000;
w=Table[Total[Times@@@DeleteCases[If[n==1,{},FactorInteger[n]],{2,_}]],{n,nn}];
spnm[y_]:=Max@@Select[Union[y],Function[i,Union[Select[y,#<=i&]]==Range[i]]];
Table[Position[w,k][[1,1]],{k,5,spnm[Join[{1,2,3,4},Take[w,nn]/.(0->1)]]}]

f(n) = my(f=factor(n), j=if (n%2, 1, 2)); sum(i=j, #f~, f[i,1]*f[i,2]); \\ A366840
a(n) = my(k=1); while (f(k) != n, k++); k; \\ Michel Marcus, Nov 02 2023

cp's OEIS Frontend

A366850 Number of integer partitions of n whose odd parts are relatively prime.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

A239259 Number of partitions of n having (sum of odd parts) < (sum of even parts).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A239260 Number of partitions of n having (sum of odd parts) <= (sum of even parts).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A239262 Number of partitions of n having (sum of odd parts) > (sum of even parts).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A239263 Number of partitions of n having (sum of odd parts) >= (sum of even parts).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A366748 Numbers k such that (sum of odd prime indices of k) = (sum of even prime indices of k).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A366839 Sum of even prime factors of 2n, counted with multiplicity.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

PARI

Formula

A366840 Sum of odd prime factors of n, counted with multiplicity.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

PARI

Formula