A323093 -id:A323093 - cp's OEIS frontend

A323092 Number of double-free integer partitions of n.

1, 1, 2, 2, 4, 5, 7, 10, 14, 17, 24, 30, 40, 50, 66, 81, 104, 128, 161, 197, 246, 300, 369, 446, 546, 656, 796, 952, 1148, 1366, 1637, 1940, 2311, 2730, 3234, 3806, 4489, 5262, 6181, 7225, 8454, 9846, 11484, 13335, 15499, 17948, 20796, 24017, 27751, 31970, 36837

Offset: 0

Gus Wiseman, Jan 04 2019

nonn

An integer partition is double-free if no part is twice any other part.

			The a(1) = 1 through a(8) = 14 double-free integer partitions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)        (8)
       (11)  (111)  (22)    (32)     (33)      (43)       (44)
                    (31)    (41)     (51)      (52)       (53)
                    (1111)  (311)    (222)     (61)       (62)
                            (11111)  (411)     (322)      (71)
                                     (3111)    (331)      (332)
                                     (111111)  (511)      (431)
                                               (4111)     (611)
                                               (31111)    (2222)
                                               (1111111)  (3311)
                                                          (5111)
                                                          (41111)
                                                          (311111)
                                                          (11111111)

Alois P. Heinz, Table of n, a(n) for n = 0..400
Eric Weisstein's World of Mathematics, Double-Free Set

Cf. A018819, A051424, A101417, A120641, A276431, A305148, A323093, A323094.

Table[Length[Select[IntegerPartitions[n],Intersection[#,2*#]=={}&]],{n,30}]

A320340 Heinz numbers of double-free integer partitions.

Original entry on oeis.org

1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 13, 14, 15, 16, 17, 19, 20, 22, 23, 25, 26, 27, 28, 29, 31, 32, 33, 34, 35, 37, 38, 39, 40, 41, 43, 44, 45, 46, 47, 49, 50, 51, 52, 53, 55, 56, 57, 58, 59, 61, 62, 64, 67, 68, 69, 70, 71, 73, 74, 75, 76, 77, 79, 80, 81, 82, 83

Offset: 1

Gus Wiseman, Jan 07 2019

nonn

The Heinz number of an integer partition (y_1, ..., y_k) is prime(y_1) * ... * prime(y_k).
An integer partition is double-free if no part is twice any other part.
Also numbers n such that if prime(m) divides n then prime(2m) does not divide n, i.e., numbers not divisible by any element of A319613.

			The sequence of all integer partitions whose Heinz numbers belong to the sequence begins: (), (1), (2), (11), (3), (4), (111), (22), (31), (5), (6), (41), (32), (1111), (7), (8), (311), (51), (9), (33), (61), (222), (411).

Alois P. Heinz, Table of n, a(n) for n = 1..20000
Eric Weisstein's World of Mathematics, Double-Free Set

Cf. A018819, A056239, A087897, A101417, A112798, A120641, A276431, A305148, A319613, A323092, A323093.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[100],Intersection[primeMS[#],2*primeMS[#]]=={}&]

A350842 Number of integer partitions of n with no difference -2.

Original entry on oeis.org

1, 1, 2, 3, 4, 6, 9, 12, 16, 24, 30, 40, 54, 69, 89, 118, 146, 187, 239, 297, 372, 468, 575, 711, 880, 1075, 1314, 1610, 1947, 2359, 2864, 3438, 4135, 4973, 5936, 7090, 8466, 10044, 11922, 14144, 16698, 19704, 23249, 27306, 32071, 37639, 44019, 51457, 60113

Offset: 0

Gus Wiseman, Jan 20 2022

nonn

			The a(1) = 1 through a(7) = 12 partitions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)
       (11)  (21)   (22)    (32)     (33)      (43)
             (111)  (211)   (41)     (51)      (52)
                    (1111)  (221)    (222)     (61)
                            (2111)   (321)     (322)
                            (11111)  (411)     (511)
                                     (2211)    (2221)
                                     (21111)   (3211)
                                     (111111)  (4111)
                                               (22111)
                                               (211111)
                                               (1111111)

Gus Wiseman, Sequences counting and ranking partitions and compositions by their differences and quotients.

Heinz number rankings are in parentheses below.
The version for no difference 0 is A000009.
The version for subsets of prescribed maximum is A005314.
The version for all differences < -2 is A025157, non-strict A116932.
The version for all differences > -2 is A034296, strict A001227.
The opposite version is A072670.
The version for no difference -1 is A116931 (A319630), strict A003114.
The multiplicative version is A350837 (A350838), strict A350840.
The strict case is A350844.
The complement for quotients is counted by A350846 (A350845).
A000041 = integer partitions.
A027187 = partitions of even length.
A027193 = partitions of odd length (A026424).
A323092 = double-free partitions (A320340), strict A120641.
A325534 = separable partitions (A335433).
A325535 = inseparable partitions (A335448).
A350839 = partitions with a gap and conjugate gap (A350841).
Cf. A000070, A000929, A001511, A003242, A007359, A018819, A040039, A045690, A045691, A101417, A154402, A323093.

Table[Length[Select[IntegerPartitions[n],FreeQ[Differences[#],-2]&]],{n,0,30}]

A120641 Number of partitions of n into distinct double-free parts.

Original entry on oeis.org

1, 1, 1, 1, 2, 3, 2, 4, 5, 5, 7, 8, 10, 12, 14, 17, 20, 24, 26, 31, 38, 45, 50, 57, 68, 77, 88, 101, 116, 132, 151, 170, 194, 222, 247, 281, 318, 356, 399, 452, 509, 567, 635, 709, 794, 885, 983, 1094, 1222, 1358, 1504, 1671, 1854, 2050, 2264, 2505, 2771, 3060, 3370

Offset: 0

Reinhard Zumkeller, Aug 17 2006

nonn

			a(10) = #{10, 9+1, 8+2, 7+3, 6+4, 5+4+1, 5+3+2} = 7;
a(11) = #{11, 10+1, 9+2, 8+3, 7+4, 7+3+1, 6+5, 6+4+1} = 8.

Alois P. Heinz, Table of n, a(n) for n = 0..400
Eric Weisstein's World of Mathematics, Double-Free Set

Cf. A000009, A050291, A101417, A303362, A320340, A323092, A323093, A323094.

Table[Length[Select[IntegerPartitions[n],UnsameQ@@#&&Intersection[#,2*#]=={}&]],{n,30}] (* Gus Wiseman, Jan 07 2019 *)

a(0)=1 prepended by Alois P. Heinz, Jan 16 2019

A101417 Number of partitions of n into parts without powers of 2.

Original entry on oeis.org

1, 0, 0, 1, 0, 1, 2, 1, 1, 3, 3, 3, 6, 5, 6, 10, 9, 12, 17, 17, 22, 28, 30, 37, 48, 52, 62, 78, 86, 103, 127, 141, 166, 201, 227, 266, 317, 358, 417, 492, 560, 647, 757, 860, 991, 1153, 1309, 1503, 1738, 1971, 2257, 2594, 2941, 3356, 3843, 4351, 4948, 5644, 6382, 7240

Offset: 0

Reinhard Zumkeller, Jan 16 2005

nonn

			a(12) = #{3+3+3+3, 6+3+3, 6+6, 7+5, 9+3, 12} = 6.
From _Gus Wiseman_, Jan 07 2019: (Start)
The a(3) = 1 through a(14) = 5 integer partitions (A = 10, ..., E = 14):
  (3)  (5)  (6)   (7)  (53)  (9)    (A)   (B)    (C)     (D)    (E)
            (33)             (63)   (55)  (65)   (66)    (76)   (77)
                             (333)  (73)  (533)  (75)    (A3)   (95)
                                                 (93)    (553)  (B3)
                                                 (633)   (733)  (653)
                                                 (3333)         (5333)
(End)

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

Cf. A000041, A018819, A000123.

Cf. A087897, A102430, A276431, A321346, A323053, A323092, A323093.

g:= product(1-x^(2^j),j=0..15)/product(1-x^i,i=1..75): gser:= series(g, x=0,62): seq(coeff(gser,x,n),n=0..59); # Emeric Deutsch, Mar 29 2006

Table[Length[Select[IntegerPartitions[n],And@@Not/@IntegerQ/@Log[2,#]&]],{n,20}] (* Gus Wiseman, Jan 07 2019 *)

G.f.: Product_{j>=1} (1-x^(2^j)) / Product_{i>=2} (1-x^i). - Emeric Deutsch, Mar 29 2006

A350837 Number of integer partitions of n with no adjacent parts of quotient 2.

Original entry on oeis.org

1, 1, 2, 2, 4, 5, 7, 10, 14, 18, 24, 31, 41, 53, 70, 87, 112, 140, 178, 221, 277, 344, 428, 526, 648, 792, 971, 1180, 1436, 1738, 2103, 2533, 3049, 3660, 4387, 5242, 6259, 7450, 8860, 10511, 12453, 14723, 17387, 20489, 24121, 28343, 33269, 38982, 45632, 53327

Offset: 0

Gus Wiseman, Jan 18 2022

nonn

The first of these partitions that is not double-free (see A323092 for definition) is (4,3,2).

			The a(1) = 1 through a(7) = 10 partitions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)
       (11)  (111)  (22)    (32)     (33)      (43)
                    (31)    (41)     (51)      (52)
                    (1111)  (311)    (222)     (61)
                            (11111)  (411)     (322)
                                     (3111)    (331)
                                     (111111)  (511)
                                               (4111)
                                               (31111)
                                               (1111111)

Gus Wiseman, Sequences counting and ranking partitions and compositions by their differences and quotients.

The version with quotients >= 2 is A000929, sets A018819.
                           <= 2 is A342094, ranked by A342191.
                           < 2 is A342096, sets A045690, strict A342097.
                           > 2 is A342098, sets A040039.
The sets version (subsets of prescribed maximum) is A045691.
These partitions are ranked by A350838.
The strict case is A350840.
A version for differences is A350842, strict A350844.
The complement is counted by A350846, ranked by A350845.
A000041 = integer partitions.
A116931 = partitions with no successions, ranked by A319630.
A116932 = partitions with differences != 1 or 2, strict A025157.
A323092 = double-free partitions, ranked by A320340.
Cf. A000070, A003000, A003114, `A003242, A051424, `A101417, A120641, A154402, A305148, A323093, A323094, A342095, A350839.

Table[Length[Select[IntegerPartitions[n], FreeQ[Divide@@@Partition[#,2,1],2]&]],{n,0,15}]

A350838 Heinz numbers of partitions with no adjacent parts of quotient 2.

Original entry on oeis.org

1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 13, 14, 15, 16, 17, 19, 20, 22, 23, 25, 26, 27, 28, 29, 31, 32, 33, 34, 35, 37, 38, 39, 40, 41, 43, 44, 45, 46, 47, 49, 50, 51, 52, 53, 55, 56, 57, 58, 59, 61, 62, 64, 67, 68, 69, 70, 71, 73, 74, 75, 76, 77, 79, 80, 81, 82, 83

Offset: 1

Gus Wiseman, Jan 18 2022

nonn

Differs from A320340 in having 105: (4,3,2), 315: (4,3,2,2), 455: (6,4,3), etc.

The Heinz number of a partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k), so these are numbers with no adjacent prime indices of quotient 1/2.

			The terms and their prime indices begin:
      1: {}            19: {8}             38: {1,8}
      2: {1}           20: {1,1,3}         39: {2,6}
      3: {2}           22: {1,5}           40: {1,1,1,3}
      4: {1,1}         23: {9}             41: {13}
      5: {3}           25: {3,3}           43: {14}
      7: {4}           26: {1,6}           44: {1,1,5}
      8: {1,1,1}       27: {2,2,2}         45: {2,2,3}
      9: {2,2}         28: {1,1,4}         46: {1,9}
     10: {1,3}         29: {10}            47: {15}
     11: {5}           31: {11}            49: {4,4}
     13: {6}           32: {1,1,1,1,1}     50: {1,3,3}
     14: {1,4}         33: {2,5}           51: {2,7}
     15: {2,3}         34: {1,7}           52: {1,1,6}
     16: {1,1,1,1}     35: {3,4}           53: {16}
     17: {7}           37: {12}            55: {3,5}

The version with quotients >= 2 is counted by A000929, sets A018819.
                           <= 2 is A342191, counted by A342094.
                           < 2 is counted by A342096, sets A045690.
                           > 2 is counted by A342098, sets A040039.
The sets version (subsets of prescribed maximum) is counted by A045691.
These partitions are counted by A350837.
The strict case is counted by A350840.
For differences instead of quotients we have A350842, strict A350844.
The complement is A350845, counted by A350846.
A000041 = integer partitions.
A000045 = sets containing n with all differences > 2.
A003114 = strict partitions with no successions, ranked by A325160.
A056239 adds up prime indices, row sums of A112798, counted by A001222.
A116931 = partitions with no successions, ranked by A319630.
A116932 = partitions with differences != 1 or 2, strict A025157.
A323092 = double-free integer partitions, ranked by A320340.
A350839 = partitions with gaps and conjugate gaps, ranked by A350841.
Cf. A000302, A001105, A003000, A018819, A094537, A120641, A154402, A319613, A323093, A337135, A342097, A342095.

primeptn[n_]:=If[n==1,{},Reverse[Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]]];
Select[Range[100],And@@Table[FreeQ[Divide@@@Partition[primeptn[#],2,1],2],{i,2,PrimeOmega[#]}]&]

A350840 Number of strict integer partitions of n with no adjacent parts of quotient 2.

Original entry on oeis.org

1, 1, 1, 1, 2, 3, 2, 4, 5, 6, 7, 8, 10, 13, 17, 19, 22, 25, 30, 35, 43, 52, 60, 70, 81, 93, 106, 122, 142, 166, 190, 216, 249, 287, 325, 371, 420, 479, 543, 617, 695, 784, 888, 1000, 1126, 1266, 1420, 1594, 1792, 2008, 2247, 2514, 2809, 3135, 3496, 3891, 4332

Offset: 0

Gus Wiseman, Jan 20 2022

nonn

			The a(1) = 1 through a(13) = 13 partitions (A..D = 10..13):
  1   2   3   4    5    6    7    8     9     A     B     C     D
              31   32   51   43   53    54    64    65    75    76
                   41        52   62    72    73    74    93    85
                             61   71    81    82    83    A2    94
                                  431   432   91    92    B1    A3
                                        531   532   A1    543   B2
                                              541   641   651   C1
                                                    731   732   643
                                                          741   652
                                                          831   751
                                                                832
                                                                931
                                                                5431

The version for subsets of prescribed maximum is A045691.
The double-free case is A120641.
The non-strict case is A350837, ranked by A350838.
An additive version (differences) is A350844, non-strict A350842.
The non-strict complement is counted by A350846, ranked by A350845.
Versions for prescribed quotients:
  = 2:  A154402, sets A001511.
  != 2: A350840 (this sequence), sets A045691.
  >= 2: A000929, sets A018819.
  <= 2: A342095, non-strict A342094.
  < 2:  A342097, non-strict A342096, sets A045690.
  > 2:  A342098, sets A040039.
A000041 = integer partitions.
A000045 = sets containing n with all differences > 2.
A003114 = strict partitions with no successions, ranked by A325160.
A116931 = partitions with no successions, ranked by A319630.
A116932 = partitions with differences != 1 or 2, strict A025157.
A323092 = double-free integer partitions, ranked by A320340.
A350839 = partitions with gaps and conjugate gaps, ranked by A350841.
Cf. A003000, A018819, A303362, A323093, A323094, A337135, A342191.

Table[Length[Select[IntegerPartitions[n],UnsameQ@@#&&And@@Table[#[[i-1]]/#[[i]]!=2,{i,2,Length[#]}]&]],{n,0,30}]

A045691 Number of binary words of length n with autocorrelation function 2^(n-1)+1.

Original entry on oeis.org

0, 1, 1, 3, 5, 11, 19, 41, 77, 159, 307, 625, 1231, 2481, 4921, 9883, 19689, 39455, 78751, 157661, 315015, 630337, 1260049, 2520723, 5040215, 10081661, 20160841, 40324163, 80643405, 161291731, 322573579, 645157041, 1290294393, 2580608475, 5161177495

Offset: 0

Torsten Sillke (torsten.sillke(AT)lhsystems.com)

nonn

From Gus Wiseman, Jan 22 2022: (Start)
Also the number of subsets of {1..n} containing n but without adjacent elements of quotient 1/2. The Heinz numbers of these sets are a subset of the squarefree terms of A320340. For example, the a(1) = 1 through a(6) = 19 subsets are:
  {1}  {2}  {3}    {4}      {5}        {6}
            {1,3}  {1,4}    {1,5}      {1,6}
            {2,3}  {3,4}    {2,5}      {2,6}
                   {1,3,4}  {3,5}      {4,6}
                   {2,3,4}  {4,5}      {5,6}
                            {1,3,5}    {1,4,6}
                            {1,4,5}    {1,5,6}
                            {2,3,5}    {2,5,6}
                            {3,4,5}    {3,4,6}
                            {1,3,4,5}  {3,5,6}
                            {2,3,4,5}  {4,5,6}
                                       {1,3,4,6}
                                       {1,3,5,6}
                                       {1,4,5,6}
                                       {2,3,4,6}
                                       {2,3,5,6}
                                       {3,4,5,6}
                                       {1,3,4,5,6}
                                       {2,3,4,5,6}
(End)

If a(n) counts subsets of {1..n} with n and without adjacent quotients 1/2:
- The version with quotients <= 1/2 is A018819, partitions A000929.
- The version with quotients < 1/2 is A040039, partitions A342098.
- The version with quotients >= 1/2 is A045690(n+1), partitions A342094.
- The version with quotients > 1/2 is A045690, partitions A342096.
- Partitions of this type are counted by A350837, ranked by A350838.
- Strict partitions of this type are counted by A350840.
- For differences instead of quotients we have A350842, strict A350844.
- Partitions not of this type are counted by A350846, ranked by A350845.
A000740 = relatively prime subsets of {1..n} containing n.
A002843 = compositions with all adjacent quotients >= 1/2.
A050291 = double-free subsets of {1..n}.
A154402 = partitions with all adjacent quotients 2.
A308546 = double-closed subsets of {1..n}, with maximum: shifted right.
A323092 = double-free integer partitions, ranked by A320340, strict A120641.
A326115 = maximal double-free subsets of {1..n}.
Cf. A000009, A001511, A003000, A003114, A116932, A274199, A323093, A342095, A342191, A342331, A342332, A342333, A342337.

Table[Length[Select[Subsets[Range[n]],MemberQ[#,n]&&And@@Table[#[[i-1]]/#[[i]]!=1/2,{i,2,Length[#]}]&]],{n,0,15}] (* Gus Wiseman, Jan 22 2022 *)

a(2*n-1) = 2*a(2*n-2) - a(n) for n >= 2; a(2*n) = 2*a(2*n-1) + a(n) for n >= 2.

More terms from Sean A. Irvine, Mar 18 2021

A323094 Number of strict integer partitions of n where no part is 2^k times any other part, for any k > 0.

Original entry on oeis.org

1, 1, 1, 1, 2, 2, 2, 4, 4, 4, 5, 7, 8, 10, 12, 12, 15, 17, 20, 24, 27, 33, 35, 41, 48, 54, 61, 69, 79, 87, 101, 113, 128, 144, 159, 181, 201, 225, 251, 281, 311, 347, 388, 428, 477, 525, 579, 643, 712, 788, 868, 954, 1051, 1155, 1272, 1398, 1534, 1682, 1840, 2016

Offset: 0

Gus Wiseman, Jan 04 2019

nonn

			The a(1) = 1 through a(12) = 8 strict integer partitions (A = 10, B = 11, C = 12):
  (1)  (2)  (3)  (4)   (5)   (6)   (7)   (8)   (9)    (A)    (B)    (C)
                 (31)  (32)  (51)  (43)  (53)  (54)   (64)   (65)   (75)
                                   (52)  (62)  (72)   (73)   (74)   (93)
                                   (61)  (71)  (531)  (91)   (83)   (A2)
                                                      (532)  (92)   (B1)
                                                             (A1)   (543)
                                                             (731)  (651)
                                                                    (732)

Fausto A. C. Cariboni, Table of n, a(n) for n = 0..400

Cf. A018819, A087897, A120641, A276431, A303362, A323054, A323092, A323093.

stableQ[u_,Q_]:=!Apply[Or,Outer[#1=!=#2&&Q[#1,#2]&,u,u,1],{0,1}];
Table[Length[Select[IntegerPartitions[n],UnsameQ@@#&&stableQ[#,IntegerQ[Log[2,#1/#2]]&]&]],{n,30}]

cp's OEIS Frontend

A323092 Number of double-free integer partitions of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A320340 Heinz numbers of double-free integer partitions.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A350842 Number of integer partitions of n with no difference -2.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

A120641 Number of partitions of n into distinct double-free parts.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A101417 Number of partitions of n into parts without powers of 2.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A350837 Number of integer partitions of n with no adjacent parts of quotient 2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A350838 Heinz numbers of partitions with no adjacent parts of quotient 2.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A350840 Number of strict integer partitions of n with no adjacent parts of quotient 2.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

A045691 Number of binary words of length n with autocorrelation function 2^(n-1)+1.

Views