A326667 -id:A326667 - cp's OEIS frontend

A326622 Number of factorizations of n into factors > 1 with integer average.

0, 1, 1, 2, 1, 1, 1, 3, 2, 1, 1, 2, 1, 1, 2, 4, 1, 1, 1, 3, 2, 1, 1, 4, 2, 1, 3, 2, 1, 1, 1, 5, 2, 1, 2, 3, 1, 1, 2, 3, 1, 2, 1, 3, 3, 1, 1, 6, 2, 2, 2, 2, 1, 2, 2, 4, 2, 1, 1, 6, 1, 1, 3, 7, 2, 1, 1, 3, 2, 1, 1, 6, 1, 1, 3, 2, 2, 2, 1, 7, 5, 1, 1, 4, 2, 1, 2, 3, 1, 1, 2, 3, 2, 1, 2, 8, 1, 1, 3, 3, 1, 1, 1, 4, 5, 1, 1, 6

Offset: 1

Gus Wiseman, Jul 14 2019

nonn

			The a(80) = 7 factorizations:
  (2*2*2*10)
  (2*2*20)
  (2*5*8)
  (2*40)
  (4*20)
  (8*10)
  (80)

Antti Karttunen, Table of n, a(n) for n = 1..65537

Partitions with integer average are A067538.
Strict partitions with integer average are A102627.
Heinz numbers of partitions with integer average are A316413.
Factorizations with integer geometric mean are A326028.
Cf. A001055, A051293, A078174, A078175, A326514, A326515, A326567/A326568, A326621, A326623, A326667 (= a(2^n)), A327906 (positions of 1's), A327907 (of terms > 1).

facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];
Table[Length[Select[facs[n],IntegerQ[Mean[#]]&]],{n,2,100}]

A326622(n, m=n, facsum=0, facnum=0) = if(1==n,facnum > 0 && 1==denominator(facsum/facnum), my(s=0); fordiv(n, d, if((d>1)&&(d<=m), s += A326622(n/d, d, facsum+d, facnum+1))); (s)); \\ Antti Karttunen, Nov 10 2024

Data section extended up to a(108), with missing term a(1)=0 also added (thus correcting the offset) - Antti Karttunen, Nov 10 2024

A326674 GCD of the set of positions of 1's in the reversed binary expansion of n.

Original entry on oeis.org

1, 2, 1, 3, 1, 1, 1, 4, 1, 2, 1, 1, 1, 1, 1, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 6, 1, 2, 1, 3, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1

Offset: 1

Gus Wiseman, Jul 17 2019

a(n) is even if and only if n is in A062880. - Robert Israel, Oct 13 2020

			The reversed binary expansion of 40 is (0,0,0,1,0,1), with positions of 1's being {4,6}, so a(40) = GCD(4,6) = 2.

Robert Israel, Table of n, a(n) for n = 1..10000

Positions of 1's are A291166, and non-1's are A291165.
GCDs of prime indices are A289508.
GCDs of strict partitions encoded by FDH numbers are A319826.
Numbers whose binary positions are pairwise coprime are A326675.
Cf. A000120, A051293, A062880, A070939, A326667, A326668, A326669, A326670, A326672, A326673.

f:= proc(n) local B;
  B:= convert(n,base,2);
  igcd(op(select(t -> B[t]=1, [$1..ilog2(n)+1])))
end proc:
map(f, [$1..100]); # Robert Israel, Oct 13 2020

Table[GCD@@Join@@Position[Reverse[IntegerDigits[n,2]],1],{n,100}]

Trivially, a(n) <= log_2(n). - Charles R Greathouse IV, Nov 15 2022

A326668 Number of strict factorizations of 2^n into factors > 1 with integer average.

Original entry on oeis.org

1, 1, 2, 2, 3, 3, 4, 4, 6, 5, 7, 7, 9, 9, 12, 12, 17, 17, 21, 24, 33, 33, 42, 46, 63, 61, 81, 82, 118, 106, 149, 137, 213, 172, 263, 221, 363, 266, 453, 335, 594, 409, 735, 484, 968, 594, 1139, 731, 1486, 813, 1801, 1026, 2177, 1230, 2667, 1348, 3334, 1693

Offset: 1

Gus Wiseman, Jul 17 2019

nonn

Also the number of strict integer partitions y of n such that the average of the set {2^s: s in y} is an integer.

			The a(1) = 1 through a(11) = 7 partitions (A = 10, B = 11):
  (1)  (2)  (3)   (4)   (5)   (6)   (7)   (8)   (9)    (A)   (B)
            (21)  (31)  (32)  (42)  (43)  (53)  (54)   (64)  (65)
                        (41)  (51)  (52)  (62)  (63)   (73)  (74)
                                    (61)  (71)  (72)   (82)  (83)
                                                (81)   (91)  (92)
                                                (531)        (A1)
                                                             (731)

The non-strict case is A326667.
Factorizations with integer average are A326622.
Strict partitions with integer average are A102627.
Subsets with integer average are A051293.
Cf. A001055, A067538, A102627, A326028, A326647, A326666, A326670, A326671.

Table[Length[Select[IntegerPartitions[n],UnsameQ@@#&&IntegerQ[Mean[2^#]]&]],{n,30}]

A326671 Number of factorizations of 2^n into factors > 1 with even integer average.

Original entry on oeis.org

1, 2, 2, 3, 4, 5, 7, 8, 11, 14, 14, 20, 27, 31, 41, 47, 57, 75, 95, 102, 155, 170, 195, 239, 327, 331, 483, 517, 617, 740, 952, 942, 1406, 1484, 1742, 2023, 2652, 2688, 3680, 3892, 4729, 5375, 6689, 6911, 9437, 9938, 11754, 13529, 16710, 17419, 22346, 24230

Offset: 1

Gus Wiseman, Jul 17 2019

nonn

Also the number of integer partitions y of n such that the average of the multiset {2^(s - 1): s in y} is an integer.

			The a(1) = 1 through a(8) = 8 partitions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)        (8)
       (11)  (111)  (22)    (32)     (33)      (43)       (44)
                    (1111)  (311)    (42)      (52)       (53)
                            (11111)  (222)     (331)      (62)
                                     (111111)  (511)      (422)
                                               (3211)     (2222)
                                               (1111111)  (4211)
                                                          (11111111)

The strict case is A326670.
Factorizations with integer average are A326622.
Partitions with integer average are A067538.
Cf. A001055, A051293, A102627, A326028, A326622, A326647, A326666, A326667, A326668.

Table[Length[Select[IntegerPartitions[n],IntegerQ[Mean[2^(#-1)]]&]],{n,30}]

A326670 Number of strict integer partitions y of n such that the average of the set {2^(s - 1): s in y} is an integer.

Original entry on oeis.org

1, 1, 1, 1, 2, 2, 3, 3, 5, 4, 6, 6, 8, 7, 10, 9, 13, 12, 15, 16, 23, 22, 27, 31, 41, 41, 50, 57, 74, 75, 90, 99, 133, 127, 158, 167, 226, 203, 278, 262, 371, 325, 457, 387, 622, 484, 715, 606, 969, 672, 1178, 866, 1428, 1050, 1776, 1142, 2276, 1459, 2514, 1792

Offset: 1

Gus Wiseman, Jul 17 2019

nonn

			The a(1) = 1 through a(12) = 6 partitions (A = 10, B = 11, C = 12):
  (1)  (2)  (3)  (4)  (5)   (6)   (7)   (8)   (9)    (A)   (B)    (C)
                      (32)  (42)  (43)  (53)  (54)   (64)  (65)   (75)
                                  (52)  (62)  (63)   (73)  (74)   (84)
                                              (72)   (82)  (83)   (93)
                                              (531)        (92)   (A2)
                                                           (731)  (642)

The non-strict case is A326671.
Strict factorizations with integer average are A326668.
Strict partitions with integer average are A102627.
Cf. A001055, A051293, A067538, A102627, A326028, A326622, A326647, A326666, A326667.

Table[Length[Select[IntegerPartitions[n],UnsameQ@@#&&IntegerQ[Mean[2^(#-1)]]&]],{n,30}]

A327906 Numbers with only one factorization into factors > 1 with integer mean (namely, as a singleton).

Original entry on oeis.org

2, 3, 5, 6, 7, 10, 11, 13, 14, 17, 18, 19, 22, 23, 26, 29, 30, 31, 34, 37, 38, 41, 43, 46, 47, 53, 58, 59, 61, 62, 66, 67, 70, 71, 73, 74, 79, 82, 83, 86, 89, 90, 94, 97, 98, 101, 102, 103, 106, 107, 109, 113, 118, 122, 127, 130, 131, 134, 137, 138, 139, 142

Offset: 1

Gus Wiseman, Sep 30 2019

nonn

			There are 4 factorizations of 24 with integer mean, namely:
  (24)
  (4*6)
  (2*12)
  (2*3*4)
so 24 is not in the sequence.

Antti Karttunen, Table of n, a(n) for n = 1..10000

Complement of A327907.
Positions of 1's in A326622.
Cf. A001055, A051293, A067538, A078175, A123528/A123529, A316413, A326515, A326516, A326666, A326667, A326671.

facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];
Select[Range[100],Length[Select[facs[#],IntegerQ[Mean[#]]&]]==1&]

A326622(n, m=n, facsum=0, facnum=0) = if(1==n,facnum > 0 && 1==denominator(facsum/facnum), my(s=0); fordiv(n, d, if((d>1)&&(d<=m), s += A326622(n/d, d, facsum+d, facnum+1))); (s)); \\ Antti Karttunen, Nov 10 2024
isA327906(n) = (1==A326622(n)); \\ Antti Karttunen, Nov 10 2024

A327907 Numbers with more than one factorization into at factors > 1 with integer mean.

Original entry on oeis.org

4, 8, 9, 12, 15, 16, 20, 21, 24, 25, 27, 28, 32, 33, 35, 36, 39, 40, 42, 44, 45, 48, 49, 50, 51, 52, 54, 55, 56, 57, 60, 63, 64, 65, 68, 69, 72, 75, 76, 77, 78, 80, 81, 84, 85, 87, 88, 91, 92, 93, 95, 96, 99, 100, 104, 105, 108, 110, 111, 112, 114, 115, 116

Offset: 1

Gus Wiseman, Sep 30 2019

nonn

			There are 6 factorizations of 60 with integer mean, namely:
  (60)
  (2*30)
  (6*10)
  (3*4*5)
  (2*3*10)
  (2*2*3*5)
so 60 is in the sequence.

Complement of A327906.
Positions of terms > 1 in A326622.
Cf. A001055, A051293, A067538, A078175, A123528/A123529, A316413, A326515, A326516, A326666, A326667, A326671.

facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];
Select[Range[100],Length[Select[facs[#],IntegerQ[Mean[#]]&]]>1&]

cp's OEIS Frontend

A326622 Number of factorizations of n into factors > 1 with integer average.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A326674 GCD of the set of positions of 1's in the reversed binary expansion of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A326668 Number of strict factorizations of 2^n into factors > 1 with integer average.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A326671 Number of factorizations of 2^n into factors > 1 with even integer average.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A326670 Number of strict integer partitions y of n such that the average of the set {2^(s - 1): s in y} is an integer.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

A327906 Numbers with only one factorization into factors > 1 with integer mean (namely, as a singleton).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A327907 Numbers with more than one factorization into at factors > 1 with integer mean.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica