A328594 -id:A328594 - cp's OEIS frontend

A329144 Number of integer partitions of n whose differences are a periodic word.

0, 0, 1, 1, 1, 3, 1, 2, 5, 3, 2, 8, 2, 5, 9, 7, 5, 12, 7, 7, 19, 9, 9, 21, 12, 15, 23, 18, 17, 29, 21, 19, 42, 23, 31, 42, 38, 29, 53, 43, 44, 62, 49, 52, 79, 55, 72, 75, 87, 63, 117, 79, 104, 107, 120, 99, 156, 117, 143, 147

Offset: 1

Gus Wiseman, Nov 10 2019

nonn

A finite sequence is periodic if its cyclic rotations are not all different.

			The a(n) partitions for n = 3, 6, 8, 9, 12, 15, 16:
  111  222     2222      333        444           555              4444
       321     11111111  432        543           654              7531
       111111            531        642           753              44332
                         32211      741           852              3332221
                         111111111  3333          951              4332211
                                    222222        33333            22222222
                                    3222111       54321            1111111111111111
                                    111111111111  322221111
                                                  111111111111111

The Heinz numbers of these partitions are given by A329134.
The augmented version is A329143.
Periodic binary words are A152061.
Periodic compositions are A178472.
Numbers whose binary expansion is periodic are A121016.
Numbers whose prime signature is periodic are A329140.
Cf. A000740, A027375, A059966, A328594, A328596, A329132, A329135, A329136.

aperQ[q_]:=Array[RotateRight[q,#1]&,Length[q],1,UnsameQ];
Table[Length[Select[IntegerPartitions[n],!aperQ[Differences[#]]&]],{n,30}]

A329401 Numbers whose binary expansion without the most significant (first) digit is a co-Lyndon word.

Original entry on oeis.org

2, 3, 6, 12, 14, 24, 28, 30, 48, 52, 56, 58, 60, 62, 96, 104, 112, 114, 116, 120, 122, 124, 126, 192, 200, 208, 212, 224, 226, 228, 232, 234, 236, 240, 242, 244, 246, 248, 250, 252, 254, 384, 400, 416, 420, 424, 448, 450, 452, 456, 458, 464, 466, 468, 472, 474

Offset: 1

Gus Wiseman, Nov 16 2019

nonn

A co-Lyndon word is a finite sequence that is lexicographically strictly greater than all of its cyclic rotations.

			The sequence of terms together with their binary expansions begins:
    2: (1,0)
    3: (1,1)
    6: (1,1,0)
   12: (1,1,0,0)
   14: (1,1,1,0)
   24: (1,1,0,0,0)
   28: (1,1,1,0,0)
   30: (1,1,1,1,0)
   48: (1,1,0,0,0,0)
   52: (1,1,0,1,0,0)
   56: (1,1,1,0,0,0)
   58: (1,1,1,0,1,0)
   60: (1,1,1,1,0,0)
   62: (1,1,1,1,1,0)
   96: (1,1,0,0,0,0,0)
  104: (1,1,0,1,0,0,0)
  112: (1,1,1,0,0,0,0)
  114: (1,1,1,0,0,1,0)
  116: (1,1,1,0,1,0,0)
  120: (1,1,1,1,0,0,0)

The version involving all digits is A275692.
Binary Lyndon/co-Lyndon words are A001037.
A ranking of binary co-Lyndon words is A329318
Cf. A059966, A060223, A102659, A211097, A211100, A328594, A328596, A329312, A329325, A329326, A329359, A329395, A329396, A329400.

colynQ[q_]:=Array[Union[{RotateRight[q,#],q}]=={RotateRight[q,#],q}&,Length[q]-1,1,And];
Select[Range[2,100],colynQ[Rest[IntegerDigits[#,2]]]&]

A257739 Numbers n for which A256999(n) > n; numbers that can be made larger by rotating (by one or more steps) the non-msb bits of their binary representation (with A080541 or A080542).

Original entry on oeis.org

5, 9, 10, 11, 13, 17, 18, 19, 20, 21, 22, 23, 25, 27, 29, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 49, 50, 51, 53, 54, 55, 57, 59, 61, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 97, 98, 99, 101, 102, 103, 105, 107, 108, 109, 110, 111

Offset: 1

Antti Karttunen, May 18 2015

Note that A256999(a(n)) is always in A257250.

If we define a co-necklace to be a finite sequence that is lexicographically maximal (not minimal) among all of its cyclic rotations, these are numbers whose binary expansion, without the most significant digit, is not a co-necklace. Numbers whose binary expansion, without the most significant digit, is not a necklace are A329367. - Gus Wiseman, Nov 14 2019

			For n = 5 with binary representation "101" if we rotate other bits than the most significant bit (that is, only the two rightmost digits "01") one step to either direction we get "110" = 6 > 5, so 5 can be made larger by such rotations and thus 5 is included in this sequence.
For n = 6 with binary representation "110" no such rotation will yield a larger number and thus 6 is NOT included in this sequence.
For n = 10 with binary representation "1010" if we rotate other bits than the most significant bit (that is, only the three rightmost digits "010") either one step to the left or two steps to the right we get "1100" = 12 > 10, thus 10 is included in this sequence.

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

Complement: A257250.
Cf. A080541, A080542, A256999.
Numbers whose binary expansion is a necklace are A275692.
Numbers whose binary expansion is a co-necklace are A065609.
Numbers whose reversed binary expansion is a necklace are A328595.
Numbers whose non-msb expansion is a co-necklace are A257250.
Numbers whose non-msb expansion is a necklace are A328668.
Numbers whose reversed non-msb expansion is a necklace are A328607.
Numbers whose non-msb expansion is not a necklace are A329367.
Binary necklaces are A000031.
Necklace compositions are A008965.
Cf. A000120, A001037, A003714, A014081, A121016, A164707, A328594, A328596.

reckQ[q_]:=Array[OrderedQ[{RotateRight[q,#],q}]&,Length[q]-1,1,And];
Select[Range[2,100],!reckQ[Rest[IntegerDigits[#,2]]]&] (* Gus Wiseman, Nov 14 2019 *)

A329137 Number of integer partitions of n whose differences are an aperiodic word.

Original entry on oeis.org

1, 1, 2, 2, 4, 6, 8, 14, 20, 25, 39, 54, 69, 99, 130, 167, 224, 292, 373, 483, 620, 773, 993, 1246, 1554, 1946, 2421, 2987, 3700, 4548, 5575, 6821, 8330, 10101, 12287, 14852, 17935, 21599, 25986, 31132, 37295, 44539, 53112, 63212, 75123, 89055, 105503, 124682

Offset: 0

Gus Wiseman, Nov 09 2019

nonn

A sequence is aperiodic if its cyclic rotations are all different.

			The a(1) = 1 through a(7) = 14 partitions:
  (1)  (2)    (3)    (4)      (5)        (6)          (7)
       (1,1)  (2,1)  (2,2)    (3,2)      (3,3)        (4,3)
                     (3,1)    (4,1)      (4,2)        (5,2)
                     (2,1,1)  (2,2,1)    (5,1)        (6,1)
                              (3,1,1)    (4,1,1)      (3,2,2)
                              (2,1,1,1)  (2,2,1,1)    (3,3,1)
                                         (3,1,1,1)    (4,2,1)
                                         (2,1,1,1,1)  (5,1,1)
                                                      (2,2,2,1)
                                                      (3,2,1,1)
                                                      (4,1,1,1)
                                                      (2,2,1,1,1)
                                                      (3,1,1,1,1)
                                                      (2,1,1,1,1,1)
With differences:
  ()  ()   ()   ()     ()       ()         ()
      (0)  (1)  (0)    (1)      (0)        (1)
                (2)    (3)      (2)        (3)
                (1,0)  (0,1)    (4)        (5)
                       (2,0)    (3,0)      (0,2)
                       (1,0,0)  (0,1,0)    (1,0)
                                (2,0,0)    (2,1)
                                (1,0,0,0)  (4,0)
                                           (0,0,1)
                                           (1,1,0)
                                           (3,0,0)
                                           (0,1,0,0)
                                           (2,0,0,0)
                                           (1,0,0,0,0)

The Heinz numbers of these partitions are given by A329135.
The periodic version is A329144.
The augmented version is A329136.
Aperiodic binary words are A027375.
Aperiodic compositions are A000740.
Numbers whose binary expansion is aperiodic are A328594.
Numbers whose prime signature is aperiodic are A329139.
Cf. A152061, A325356, A329132, A329133, A329134, A329140.

aperQ[q_]:=Array[RotateRight[q,#1]&,Length[q],1,UnsameQ];
Table[Length[Select[IntegerPartitions[n],aperQ[Differences[#]]&]],{n,0,30}]

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

A329357 Numbers whose reversed binary expansion has co-Lyndon factorization of length 2.

Original entry on oeis.org

2, 3, 5, 9, 11, 17, 19, 23, 33, 35, 37, 39, 43, 47, 65, 67, 69, 71, 75, 79, 83, 87, 95, 129, 131, 133, 135, 137, 139, 143, 147, 149, 151, 155, 159, 163, 167, 171, 175, 183, 191, 257, 259, 261, 263, 265, 267, 271, 275, 277, 279, 283, 287, 291, 293, 295, 299

Offset: 1

Gus Wiseman, Nov 12 2019

nonn

First differs from A329327 in lacking 77 and having 83.

The co-Lyndon product of two or more finite sequences is defined to be the lexicographically minimal sequence obtainable by shuffling the sequences together. For example, the co-Lyndon product of (231) and (213) is (212313), the product of (221) and (213) is (212213), and the product of (122) and (2121) is (1212122). A co-Lyndon word is a finite sequence that is prime with respect to the co-Lyndon product. Equivalently, a co-Lyndon word is a finite sequence that is lexicographically strictly greater than all of its cyclic rotations. Every finite sequence has a unique (orderless) factorization into co-Lyndon words, and if these factors are arranged in a certain order, their concatenation is equal to their co-Lyndon product. For example, (1001) has sorted co-Lyndon factorization (1)(100).

			The reversed binary expansion of each term together with their co-Lyndon factorizations:
   2:      (01) = (0)(1)
   3:      (11) = (1)(1)
   5:     (101) = (10)(1)
   9:    (1001) = (100)(1)
  11:    (1101) = (110)(1)
  17:   (10001) = (1000)(1)
  19:   (11001) = (1100)(1)
  23:   (11101) = (1110)(1)
  33:  (100001) = (10000)(1)
  35:  (110001) = (11000)(1)
  37:  (101001) = (10100)(1)
  39:  (111001) = (11100)(1)
  43:  (110101) = (11010)(1)
  47:  (111101) = (11110)(1)
  65: (1000001) = (100000)(1)
  67: (1100001) = (110000)(1)
  69: (1010001) = (101000)(1)
  71: (1110001) = (111000)(1)
  75: (1101001) = (110100)(1)
  79: (1111001) = (111100)(1)

Positions of 2's in A329326.
Binary co-Lyndon words are counted by A001037 and ranked by A329318.
Length of the co-Lyndon factorization of the binary expansion is A329312.
Cf. A059966, A060223, A102659, A211097, A211100, A275692, A328594, A328595, A328596, A329131, A329313, A329314, A329325, A329359.

colynQ[q_]:=Array[Union[{RotateRight[q,#],q}]=={RotateRight[q,#],q}&,Length[q]-1,1,And];
colynfac[q_]:=If[Length[q]==0,{},Function[i,Prepend[colynfac[Drop[q,i]],Take[q,i]]]@Last[Select[Range[Length[q]],colynQ[Take[q,#]]&]]];
Select[Range[100],Length[colynfac[Reverse[IntegerDigits[#,2]]]]==2&]

A333767 Length of shortest run of zeros after a one in the binary expansion of n. a(0) = 0.

Original entry on oeis.org

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

Offset: 0

Gus Wiseman, Apr 06 2020

nonn

			The binary expansion of 148 is (1,0,0,1,0,1,0,0), so a(148) = 1.

Positions of first appearances (ignoring index 0) are A000079.
Positions of terms > 0 are A022340.
Minimum prime index is A055396.
The  maximum part minus 1 is given by A087117.
All of the following pertain to compositions in standard order (A066099):
- Length is A000120.
- Compositions without 1's are A022340.
- Sum is A070939.
- Product is A124758.
- Runs are counted by A124767.
- Strict compositions are A233564.
- Constant compositions are A272919.
- Runs-resistance is A333628.
- Maximum is A333766.
- Minimum is A333768.
- Weakly decreasing compositions are A114994.
- Weakly increasing compositions are A225620.
- Strictly decreasing compositions are A333255.
- Strictly increasing compositions are A333256.
Cf. A029931, A048793, A228351, A328594, A333217, A333218, A333219, A333632.

stc[n_]:=Differences[Prepend[Join@@Position[Reverse[IntegerDigits[n,2]],1],0]]//Reverse;
Table[If[n==0,0,Min@@stc[n]-1],{n,0,100}]

For n > 0, a(n) = A333768(n) - 1.

A334031 The smallest number whose unsorted prime signature is the reversed n-th composition in standard order.

Original entry on oeis.org

1, 2, 4, 6, 8, 18, 12, 30, 16, 54, 36, 150, 24, 90, 60, 210, 32, 162, 108, 750, 72, 450, 300, 1470, 48, 270, 180, 1050, 120, 630, 420, 2310, 64, 486, 324, 3750, 216, 2250, 1500, 10290, 144, 1350, 900, 7350, 600, 4410, 2940, 25410, 96, 810, 540, 5250, 360, 3150

Offset: 0

Gus Wiseman, Apr 17 2020

nonn

All terms are normal (A055932), meaning their prime indices cover an initial interval of positive integers.
Unsorted prime signature is the sequence of exponents in a number's prime factorization.
The k-th composition in standard order (row k of A066099) is obtained by taking the set of positions of 1's in the reversed binary expansion of k, prepending 0, taking first differences, and reversing again. This gives a bijective correspondence between nonnegative integers and integer compositions.

			The sequence of terms together with their prime indices begins:
       1: {}
       2: {1}
       4: {1,1}
       6: {1,2}
       8: {1,1,1}
      18: {1,2,2}
      12: {1,1,2}
      30: {1,2,3}
      16: {1,1,1,1}
      54: {1,2,2,2}
      36: {1,1,2,2}
     150: {1,2,3,3}
      24: {1,1,1,2}
      90: {1,2,2,3}
      60: {1,1,2,3}
     210: {1,2,3,4}
      32: {1,1,1,1,1}
     162: {1,2,2,2,2}
For example, the 13th composition in standard order is (1,2,1), and the least number with prime signature (1,2,1) is 90 = 2^1 * 3^2 * 5^1, so a(13) = 90.

The range is A055932.
The non-reversed version is A057335.
Unsorted prime signature is A124010.
Numbers whose prime signature is aperiodic are A329139.
Normal numbers with standard compositions as prime signature are A334032.
All of the following pertain to compositions in standard order (A066099):
- Length is A000120.
- Sum is A070939.
- Strict compositions are A233564.
- Constant compositions are A272919.
- Aperiodic compositions are A328594.
- Normal compositions are A333217.
- Heinz number is A333219.
Cf. A029931, A048793, A056239, A112798, A228351, A233249, A272020, A333218, A333220, A334032.

stc[n_]:=Differences[Prepend[Join@@Position[Reverse[IntegerDigits[n,2]],1],0]]//Reverse;
Table[Product[Prime[i]^stc[n][[-i]],{i,DigitCount[n,2,1]}],{n,0,100}]

a(n) = A057335(A059893(n)).

A334033 The a(n)-th composition in standard order (graded reverse-lexicographic) is the reversed unsorted prime signature of n.

Original entry on oeis.org

0, 1, 1, 2, 1, 3, 1, 4, 2, 3, 1, 6, 1, 3, 3, 8, 1, 5, 1, 6, 3, 3, 1, 12, 2, 3, 4, 6, 1, 7, 1, 16, 3, 3, 3, 10, 1, 3, 3, 12, 1, 7, 1, 6, 6, 3, 1, 24, 2, 5, 3, 6, 1, 9, 3, 12, 3, 3, 1, 14, 1, 3, 6, 32, 3, 7, 1, 6, 3, 7, 1, 20, 1, 3, 5, 6, 3, 7, 1, 24, 8, 3, 1

Offset: 1

Gus Wiseman, Apr 18 2020

nonn

Unsorted prime signature (A124010) is the sequence of exponents in a number's prime factorization.

The k-th composition in standard order (row k of A066099) is obtained by taking the set of positions of 1's in the reversed binary expansion of k, prepending 0, taking first differences, and reversing again. This gives a bijective correspondence between nonnegative integers and integer compositions.

			The unsorted prime signature of 12345678 is (1,2,1,1), whose reverse (1,1,2,1) is the 29th composition in standard order, so a(12345678) = 29.

Positions of first appearances are A334031.
The non-reversed version is A334032.
Unsorted prime signature is A124010.
Least number with reversed prime signature is A331580.
All of the following pertain to compositions in standard order (A066099):
- Length is A000120.
- Sum is A070939.
- Strict compositions are A233564.
- Constant compositions are A272919.
- Aperiodic compositions are A328594.
- Normal compositions are A333217.
- Permutations are A333218.
- Heinz number is A333219.
Cf. A029931, A048793, A052409, A055932, A056239, A057335, A071364, A112798, A124767, A228351, A233249, A329139, A333220.

stcinv[q_]:=Total[2^Accumulate[Reverse[q]]]/2;
Table[stcinv[Reverse[Last/@If[n==1,{},FactorInteger[n]]]],{n,100}]

a(A334031(n)) = n.
A334031(a(n)) = A071364(n).
a(A057335(n))= A059893(n).
A057335(a(n)) = A331580(n).

cp's OEIS Frontend

A329144 Number of integer partitions of n whose differences are a periodic word.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A329401 Numbers whose binary expansion without the most significant (first) digit is a co-Lyndon word.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A257739 Numbers n for which A256999(n) > n; numbers that can be made larger by rotating (by one or more steps) the non-msb bits of their binary representation (with A080541 or A080542).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A329137 Number of integer partitions of n whose differences are an aperiodic word.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A329357 Numbers whose reversed binary expansion has co-Lyndon factorization of length 2.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A333767 Length of shortest run of zeros after a one in the binary expansion of n. a(0) = 0.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

Formula

A334031 The smallest number whose unsorted prime signature is the reversed n-th composition in standard order.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A334033 The a(n)-th composition in standard order (graded reverse-lexicographic) is the reversed unsorted prime signature of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula