A355536 -id:A355536 - cp's OEIS frontend

A372430 Positive integers k such that the distinct prime indices of k are a subset of the binary indices of k.

1, 3, 5, 15, 27, 39, 55, 63, 85, 121, 125, 135, 169, 171, 175, 209, 243, 247, 255, 299, 375, 399, 437, 459, 507, 539, 605, 637, 725, 735, 783, 841, 867, 891, 1085, 1215, 1323, 1331, 1375, 1519, 1767, 1815, 1863, 2079, 2125, 2187, 2223, 2295, 2299, 2331, 2405

Offset: 1

Gus Wiseman, May 02 2024

A binary index of n is any position of a 1 in its reversed binary expansion. The binary indices of n are row n of A048793.
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.
Conjecture: The only number whose binary indices are a subset of its prime indices is 4100, with binary indices {3,13} and prime indices {1,1,3,3,13}. Verified up to 10,000,000.

			The prime indices of 135 are {2,2,2,3}, and the binary indices are {1,2,3,8}. Since {2,3} is a subset of {1,2,3,8}, 135 is in the sequence.
The terms together with their prime indices begin:
     1: {}
     3: {2}
     5: {3}
    15: {2,3}
    27: {2,2,2}
    39: {2,6}
    55: {3,5}
    63: {2,2,4}
    85: {3,7}
   121: {5,5}
   125: {3,3,3}
The terms together with their binary expansions and binary indices begin:
     1:              1 ~ {1}
     3:             11 ~ {1,2}
     5:            101 ~ {1,3}
    15:           1111 ~ {1,2,3,4}
    27:          11011 ~ {1,2,4,5}
    39:         100111 ~ {1,2,3,6}
    55:         110111 ~ {1,2,3,5,6}
    63:         111111 ~ {1,2,3,4,5,6}
    85:        1010101 ~ {1,3,5,7}
   121:        1111001 ~ {1,4,5,6,7}
   125:        1111101 ~ {1,3,4,5,6,7}

The version for equal lengths is A071814, zeros of A372441.
The version for equal sums is A372427, zeros of A372428.
For disjoint instead of subset we have A372431, complement A372432.
The version for equal maxima is A372436, zeros of A372442.
A019565 gives Heinz number of binary indices, adjoint A048675.
A029837 gives greatest binary index, least A001511.
A048793 lists binary indices, length A000120, reverse A272020, sum A029931.
A061395 gives greatest prime index, least A055396.
A070939 gives length of binary expansion.
A112798 lists prime indices, length A001222, reverse A296150, sum A056239.
Cf. A000720, A001221, A230877, A243055, A304818, A355536, A358136, A372429.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
bix[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
Select[Range[1000],SubsetQ[bix[#],prix[#]]&]

Row k of A304038 is a subset of row k of A048793.

A358169 Row n lists the first differences plus one of the prime indices of n with 1 prepended.

Original entry on oeis.org

1, 2, 1, 1, 3, 1, 2, 4, 1, 1, 1, 2, 1, 1, 3, 5, 1, 1, 2, 6, 1, 4, 2, 2, 1, 1, 1, 1, 7, 1, 2, 1, 8, 1, 1, 3, 2, 3, 1, 5, 9, 1, 1, 1, 2, 3, 1, 1, 6, 2, 1, 1, 1, 1, 4, 10, 1, 2, 2, 11, 1, 1, 1, 1, 1, 2, 4, 1, 7, 3, 2, 1, 1, 2, 1, 12, 1, 8, 2, 5, 1, 1, 1, 3

Offset: 2

Gus Wiseman, Nov 01 2022

Every nonempty composition appears as a row exactly once.
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. Here this multiset is regarded as a sequence in weakly increasing order.
Also the reversed augmented differences of the integer partition with Heinz number n, where the augmented differences aug(q) of a sequence q of length k are given by aug(q)i = q_i - q{i+1} + 1 if i < k and aug(q)_k = q_k, and the Heinz number of a partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k). The non-reversed version is A355534.

			Triangle begins:
   2: 1
   3: 2
   4: 1 1
   5: 3
   6: 1 2
   7: 4
   8: 1 1 1
   9: 2 1
  10: 1 3
  11: 5
  12: 1 1 2
  13: 6
  14: 1 4
  15: 2 2
  16: 1 1 1 1
  17: 7
  18: 1 2 1
  19: 8
  20: 1 1 3

Gus Wiseman, Sequences counting and ranking integer partitions by the differences of their successive parts.

Row-lengths are A001222.
The first term of each row is A055396.
Row-sums are A252464.
The rows appear to be ranked by A253566.
Another variation is A287352.
Constant rows have indices A307824.
The Heinz numbers of the rows are A325351.
Strict rows have indices A325366.
Row-minima are A355531, also A355524 and A355525.
Row-maxima are A355532, non-augmented A286470, also A355526.
Reversing rows gives A355534.
The non-augmented version A355536, also A355533.
A112798 lists prime indices, sum A056239.
Cf. A124010, A243055, A243056, A325352, A325390, A355523, A355528.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Table[Differences[Prepend[primeMS[n],1]]+1,{n,30}]

A372431 Positive integers k such that the prime indices of k are disjoint from the binary indices of k.

Original entry on oeis.org

1, 2, 4, 7, 8, 9, 10, 11, 12, 13, 16, 17, 19, 21, 23, 24, 25, 26, 29, 31, 32, 33, 34, 35, 36, 37, 38, 40, 41, 43, 44, 46, 47, 48, 49, 50, 53, 57, 58, 59, 61, 62, 64, 65, 67, 69, 71, 72, 73, 74, 76, 79, 80, 81, 82, 83, 84, 86, 89, 92, 93, 94, 96, 97, 98, 101

Offset: 1

Gus Wiseman, May 03 2024

A binary index of n is any position of a 1 in its reversed binary expansion. The binary indices of n are row n of A048793.

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 binary indices of 65 are {1,7}, and the prime indices are {3,6}, so 65 is in the sequence.
The terms together with their prime indices begin:
     1: {}
     2: {1}
     4: {1,1}
     7: {4}
     8: {1,1,1}
     9: {2,2}
    10: {1,3}
    11: {5}
    12: {1,1,2}
    13: {6}
    16: {1,1,1,1}
The terms together with their binary expansions and binary indices begin:
   1:       1 ~ {1}
   2:      10 ~ {2}
   4:     100 ~ {3}
   7:     111 ~ {1,2,3}
   8:    1000 ~ {4}
   9:    1001 ~ {1,4}
  10:    1010 ~ {2,4}
  11:    1011 ~ {1,2,4}
  12:    1100 ~ {3,4}
  13:    1101 ~ {1,3,4}
  16:   10000 ~ {5}

For subset instead of disjoint we have A372430.
The complement is A372432.
Equal lengths: A071814, zeros of A372441.
Equal sums: A372427, zeros of A372428.
Equal maxima: A372436, zeros of A372442.
A019565 gives Heinz number of binary indices, adjoint A048675.
A029837 gives greatest binary index, least A001511.
A048793 lists binary indices, length A000120, reverse A272020, sum A029931.
A061395 gives greatest prime index, least A055396.
A070939 gives length of binary expansion.
A112798 lists prime indices, length A001222, reverse A296150, sum A056239.
Cf. A000720, A001221, A059893, A096111, A230877, A243055, A304818, A355536, A358136, A372429.

bix[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[100],Intersection[bix[#],prix[#]]=={}&]

A383535 Heinz number of the positive first differences of the 0-prepended prime indices of n.

Original entry on oeis.org

1, 2, 3, 2, 5, 4, 7, 2, 3, 6, 11, 4, 13, 10, 6, 2, 17, 4, 19, 6, 9, 14, 23, 4, 5, 22, 3, 10, 29, 8, 31, 2, 15, 26, 10, 4, 37, 34, 21, 6, 41, 12, 43, 14, 6, 38, 47, 4, 7, 6, 33, 22, 53, 4, 15, 10, 39, 46, 59, 8, 61, 58, 9, 2, 25, 20, 67, 26, 51, 12, 71, 4, 73

Offset: 1

Gus Wiseman, May 21 2025

nonn

The Heinz number of a partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k). This gives a bijective correspondence between positive integers and integer partitions.

Also Heinz number of the first differences of the distinct 0-prepended prime indices of n.

			The terms together with their prime indices begin:
     1: {}        2: {1}        31: {11}       38: {1,8}
     2: {1}      17: {7}         2: {1}        47: {15}
     3: {2}       4: {1,1}      15: {2,3}       4: {1,1}
     2: {1}      19: {8}        26: {1,6}       7: {4}
     5: {3}       6: {1,2}      10: {1,3}       6: {1,2}
     4: {1,1}     9: {2,2}       4: {1,1}      33: {2,5}
     7: {4}      14: {1,4}      37: {12}       22: {1,5}
     2: {1}      23: {9}        34: {1,7}      53: {16}
     3: {2}       4: {1,1}      21: {2,4}       4: {1,1}
     6: {1,2}     5: {3}         6: {1,2}      15: {2,3}
    11: {5}      22: {1,5}      41: {13}       10: {1,3}
     4: {1,1}     3: {2}        12: {1,1,2}    39: {2,6}
    13: {6}      10: {1,3}      43: {14}       46: {1,9}
    10: {1,3}    29: {10}       14: {1,4}      59: {17}
     6: {1,2}     8: {1,1,1}     6: {1,2}       8: {1,1,1}

For multiplicities instead of differences we have A181819.
Positions of first appearances are A358137.
Positions of squarefree numbers are A383512, counted by A098859.
Positions of nonsquarefree numbers are A383513, counted by A336866.
These are Heinz numbers of rows of A383534.
A000040 lists the primes, differences A001223.
A048767 is the Look-and-Say transform, union A351294, complement A351295.
A056239 adds up prime indices, row sums of A112798, counted by A001222.
A320348 counts strict partitions with distinct 0-appended differences, ranks A325388.
A325324 counts partitions with distinct 0-appended differences, ranks A325367.
Cf. A122111, A124010 (prime signature), A130091, A287352, A325351, A325366, A325368, A355536, A381431, A384008, A384009.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Table[Times@@Prime/@DeleteCases[Differences[Prepend[prix[n],0]],0],{n,100}]

A001222(a(n)) = A001221(n).
A056239(a(n)) = A061395(n).
A055396(a(n)) = A055396(n).
A061395(a(n)) = A241919(n).

A359397 Squarefree numbers with weakly decreasing first differences of 0-prepended prime indices.

Original entry on oeis.org

1, 2, 3, 5, 6, 7, 11, 13, 15, 17, 19, 21, 23, 29, 30, 31, 35, 37, 41, 43, 47, 53, 55, 59, 61, 65, 67, 71, 73, 77, 79, 83, 89, 91, 97, 101, 103, 105, 107, 109, 113, 119, 127, 131, 133, 137, 139, 143, 149, 151, 157, 163, 167, 173, 179, 181, 187, 191, 193, 197

Offset: 1

Gus Wiseman, Dec 31 2022

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.

			715 has prime indices {3,5,6}, with first differences (2,1), which are weakly decreasing, so 715 is in the sequence.

This is the squarefree case of A325362.
These are the sorted Heinz numbers of rows of A359361.
A005117 lists squarefree numbers.
A112798 lists prime indices, length A001222, sum A056239, reverse A296150.
A355536 lists first differences of prime indices, 0-prepended A287352.
A358136 lists partial sums of prime indices, row sums A318283.
Cf. A000009, A000720, A001221, A253566, A261079, A304818, A358137, A358169.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[100],SquareFreeQ[#]&&GreaterEqual@@Differences[Prepend[primeMS[#],0]]&]

Intersection of A325362 and A005117.

A384009 Irregular triangle read by rows where row n lists the positive first differences of the prime indices of n.

Original entry on oeis.org

1, 2, 1, 3, 1, 1, 2, 2, 4, 1, 5, 3, 1, 1, 3, 6, 1, 1, 7, 4, 2, 1, 2, 4, 1, 8, 1, 2, 5, 5, 1, 2, 3, 6, 9, 1, 1, 10, 2, 3, 1, 3, 6, 7, 2, 1, 1, 11, 1, 7, 1, 1, 4, 2, 12, 1, 2, 4, 13, 8, 4, 1, 1, 2, 8, 9, 14, 5, 1, 3, 3, 2, 1, 5, 5, 1, 1, 15, 1, 2, 2, 10, 3, 1, 6, 6

Offset: 1

Gus Wiseman, May 23 2025

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 prime indices of 60 are {1,1,2,3}, differences (0,1,1), positive (1,1).
Rows begin:
     1: ()     16: ()       31: ()       46: (8)
     2: ()     17: ()       32: ()       47: ()
     3: ()     18: (1)      33: (3)      48: (1)
     4: ()     19: ()       34: (6)      49: ()
     5: ()     20: (2)      35: (1)      50: (2)
     6: (1)    21: (2)      36: (1)      51: (5)
     7: ()     22: (4)      37: ()       52: (5)
     8: ()     23: ()       38: (7)      53: ()
     9: ()     24: (1)      39: (4)      54: (1)
    10: (2)    25: ()       40: (2)      55: (2)
    11: ()     26: (5)      41: ()       56: (3)
    12: (1)    27: ()       42: (1,2)    57: (6)
    13: ()     28: (3)      43: ()       58: (9)
    14: (3)    29: ()       44: (4)      59: ()
    15: (1)    30: (1,1)    45: (1)      60: (1,1)

Row-lengths are A001221(n) - 1, sums A243055.
For multiplicities instead of differences we have A124010 (prime signature).
Positions of non-strict rows are a subset of A325992.
Including difference 0 gives A355536, 0-prepended A287352.
The 0-prepended version is A383534.
A000040 lists the primes, differences A001223.
A056239 adds up prime indices, row sums of A112798, counted by A001222.
Cf. A039956, A048767, A055396, A061395, A130091, A320348, A325325, A325349, A325368, A358137, A381431.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Table[DeleteCases[Differences[prix[n]],0],{n,100}]

A384008 Irregular triangle read by rows where row n lists the first differences of the 0-prepended prime indices of the n-th squarefree number.

Original entry on oeis.org

1, 2, 3, 1, 1, 4, 1, 2, 5, 6, 1, 3, 2, 1, 7, 8, 2, 2, 1, 4, 9, 1, 5, 10, 1, 1, 1, 11, 2, 3, 1, 6, 3, 1, 12, 1, 7, 2, 4, 13, 1, 1, 2, 14, 1, 8, 15, 2, 5, 16, 3, 2, 2, 6, 1, 9, 17, 18, 1, 10, 3, 3, 1, 1, 3, 19, 2, 7, 1, 2, 1, 20, 21, 1, 11, 4, 1, 1, 1, 4, 22, 1, 12, 23, 3, 4

Offset: 1

Gus Wiseman, May 23 2025

All rows are different.

			The 28-th squarefree number is 42, with 0-prepended prime indices (0,1,2,4), with differences (1,1,2), so row 28 is (1,1,2).
The squarefree numbers and corresponding rows begin:
    1: ()        23: (9)        47: (15)
    2: (1)       26: (1,5)      51: (2,5)
    3: (2)       29: (10)       53: (16)
    5: (3)       30: (1,1,1)    55: (3,2)
    6: (1,1)     31: (11)       57: (2,6)
    7: (4)       33: (2,3)      58: (1,9)
   10: (1,2)     34: (1,6)      59: (17)
   11: (5)       35: (3,1)      61: (18)
   13: (6)       37: (12)       62: (1,10)
   14: (1,3)     38: (1,7)      65: (3,3)
   15: (2,1)     39: (2,4)      66: (1,1,3)
   17: (7)       41: (13)       67: (19)
   19: (8)       42: (1,1,2)    69: (2,7)
   21: (2,2)     43: (14)       70: (1,2,1)
   22: (1,4)     46: (1,8)      71: (20)

Row-lengths are A072047, sums A243290.
This is the restriction of A383534 (ranked by A383535) to rows of squarefree index.
A000040 lists the primes, differences A001223.
A048767 is the Look-and-Say transform, union A351294, complement A351295.
A056239 adds up prime indices, row sums of A112798, counted by A001222.
A320348 counts strict partitions with distinct 0-appended differences, ranks A325388.
A325324 counts partitions with distinct 0-appended differences, ranks A325367.
Cf. A001221, A005117, A055396, A061395, A325325, A355536, A358137, A384009.

sql=Select[Range[100],SquareFreeQ];
prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Table[Differences[Prepend[prix[sql[[n]]],0]],{n,Length[sql]}]

A358171 The a(n)-th composition in standard order (A066099) is the first differences plus one of the prime indices of n (A112798).

Original entry on oeis.org

0, 0, 0, 1, 0, 2, 0, 3, 1, 4, 0, 6, 0, 8, 2, 7, 0, 5, 0, 12, 4, 16, 0, 14, 1, 32, 3, 24, 0, 10, 0, 15, 8, 64, 2, 13, 0, 128, 16, 28, 0, 20, 0, 48, 6, 256, 0, 30, 1, 9, 32, 96, 0, 11, 4, 56, 64, 512, 0, 26, 0, 1024, 12, 31, 8, 40, 0, 192, 128, 18, 0, 29, 0

Offset: 1

Gus Wiseman, Dec 21 2022

nonn

The k-th composition in standard order (graded reverse-lexicographic, 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.

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 prime indices of 36 are {1,1,2,2}, with first differences plus one (1,2,1), which is the 13th composition in standard order, so a(36) = 13.

Gus Wiseman, Statistics, classes, and transformations of standard compositions

See link for sequences related to standard compositions.
Prepend 1 to indices: A253566 (cf. A358169), inverse A253565 (cf. A242628).
Taking Heinz number instead of standard composition number gives A325352.
These compositions minus one are listed by A355536, sums A243055.
A001222 counts prime indices, distinct A001221.
A066099 lists standard compositions, lengths A000120, sums A070939.
A112798 lists prime indices, sum A056239.
A355534 = augmented diffs. of rev. prime indices, Heinz numbers A325351.
Cf. A000720, A005940, A055932, A057335, A066312, A286470, A287352, A325390.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
stcinv[q_]:=Total[2^(Accumulate[Reverse[q]])]/2;
Table[stcinv[Differences[primeMS[n]]+1],{n,100}]

cp's OEIS Frontend

A372430 Positive integers k such that the distinct prime indices of k are a subset of the binary indices of k.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A358169 Row n lists the first differences plus one of the prime indices of n with 1 prepended.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A372431 Positive integers k such that the prime indices of k are disjoint from the binary indices of k.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A383535 Heinz number of the positive first differences of the 0-prepended prime indices of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A359397 Squarefree numbers with weakly decreasing first differences of 0-prepended prime indices.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A384009 Irregular triangle read by rows where row n lists the positive first differences of the prime indices of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A384008 Irregular triangle read by rows where row n lists the first differences of the 0-prepended prime indices of the n-th squarefree number.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A358171 The a(n)-th composition in standard order (A066099) is the first differences plus one of the prime indices of n (A112798).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica