A096111 -id:A096111 - cp's OEIS frontend

A372885 Prime numbers whose binary indices (positions of ones in reversed binary expansion) sum to another prime number.

2, 3, 11, 23, 29, 41, 43, 61, 71, 79, 89, 101, 103, 113, 131, 137, 149, 151, 163, 181, 191, 197, 211, 239, 269, 271, 281, 293, 307, 331, 349, 353, 373, 383, 401, 433, 457, 491, 503, 509, 523, 541, 547, 593, 641, 683, 701, 709, 743, 751, 761, 773, 827, 863, 887

Offset: 1

Gus Wiseman, May 19 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.

The indices of these primes are A372886.

			The binary indices of 89 are {1,4,5,7}, with sum 17, which is prime, so 89 is in the sequence.
The terms together with their binary expansions and binary indices begin:
    2:         10 ~ {2}
    3:         11 ~ {1,2}
   11:       1011 ~ {1,2,4}
   23:      10111 ~ {1,2,3,5}
   29:      11101 ~ {1,3,4,5}
   41:     101001 ~ {1,4,6}
   43:     101011 ~ {1,2,4,6}
   61:     111101 ~ {1,3,4,5,6}
   71:    1000111 ~ {1,2,3,7}
   79:    1001111 ~ {1,2,3,4,7}
   89:    1011001 ~ {1,4,5,7}
  101:    1100101 ~ {1,3,6,7}
  103:    1100111 ~ {1,2,3,6,7}
  113:    1110001 ~ {1,5,6,7}
  131:   10000011 ~ {1,2,8}
  137:   10001001 ~ {1,4,8}
  149:   10010101 ~ {1,3,5,8}
  151:   10010111 ~ {1,2,3,5,8}
  163:   10100011 ~ {1,2,6,8}
  181:   10110101 ~ {1,3,5,6,8}
  191:   10111111 ~ {1,2,3,4,5,6,8}
  197:   11000101 ~ {1,3,7,8}

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

For prime instead of binary indices we have A006450, prime case of A316091.
Prime numbers p such that A029931(p) is also prime.
Prime case of A372689.
The indices of these primes are A372886.
A000040 lists the prime numbers, A014499 their binary indices.
A019565 gives Heinz number of binary indices, adjoint A048675.
A058698 counts partitions of prime numbers, strict A064688.
A372687 counts strict partitions of prime binary rank, counted by A372851.
A372688 counts partitions of prime binary rank, with Heinz numbers A277319.
Binary indices:
- listed A048793, sum A029931
- reversed A272020
- opposite A371572, sum A230877
- length A000120, complement A023416
- min A001511, opposite A000012
- max A070939, opposite A070940
- complement A368494, sum A359400
- opposite complement A371571, sum A359359
Cf. A000009, A029837, A035100, A038499, A096111, A372429, A372441, A372471, A372850, A372887.

filter:= proc(p)
  local L,i,t;
  L:= convert(p,base,2);
  isprime(add(i*L[i],i=1..nops(L)))
end proc:
select(filter, [seq(ithprime(i),i=1..200)]); # Robert Israel, Jun 19 2025

Select[Range[100],PrimeQ[#] && PrimeQ[Total[First/@Position[Reverse[IntegerDigits[#,2]],1]]]&]

A372890 Sum of binary ranks of all integer partitions of n, where the binary rank of a partition y is given by Sum_i 2^(y_i-1).

Original entry on oeis.org

0, 1, 4, 10, 25, 52, 115, 228, 471, 931, 1871, 3687, 7373, 14572, 29049, 57694, 115058, 229101, 457392, 912469, 1822945, 3640998, 7277426, 14544436, 29079423, 58137188, 116254386, 232465342, 464889800, 929691662, 1859302291, 3718428513, 7436694889, 14873042016

Offset: 0

Gus Wiseman, May 23 2024

nonn

			The partitions of 4 are (4), (3,1), (2,2), (2,1,1), (1,1,1,1), with respective binary ranks 8, 5, 4, 4, 4 with sum 25, so a(4) = 25.

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

For Heinz number (not binary rank) we have A145519, row sums of A215366.
For Heinz number the strict version is A147655, row sums of A246867.
The strict version is A372888, row sums of A118462.
A005117 gives Heinz numbers of strict integer partitions.
A048675 gives binary rank of prime indices, distinct A087207.
A061395 gives greatest prime index, least A055396.
A118457 lists strict partitions in Mathematica order.
A277905 groups all positive integers by binary rank of prime indices.
Binary indices (A048793):
- length A000120, complement A023416
- min A001511, opposite A000012
- max A029837 or A070939, opposite A070940
- sum A029931, product A096111
- reverse A272020
- complement A368494, sum A359400
- opposite complement A371571, sum A359359
- opposite A371572, sum A230877
Cf. A000041, A005940, A018819, A019565, A066633, A225620, A344086, A365410.

b:= proc(n, i) option remember; `if`(n=0 or i=1, [1, n],
      b(n, i-1)+(p->[0, p[1]*2^(i-1)]+p)(b(n-i, min(n-i, i))))
    end:
a:= n-> b(n$2)[2]:
seq(a(n), n=0..33);  # Alois P. Heinz, May 23 2024

Table[Total[Total[2^(#-1)]&/@IntegerPartitions[n]],{n,0,10}]

From Alois P. Heinz, May 23 2024: (Start)
a(n) = Sum_{k=1..n} 2^(k-1) * A066633(n,k).
a(n) mod 2 = A365410(n-1) for n>=1. (End)

A096113 a(1) = 1, a(2) = 2; then all new products of subsets of pre-existing terms, then the first integer not present, and so on.

Original entry on oeis.org

1, 2, 3, 6, 4, 8, 12, 18, 24, 36, 48, 72, 144, 5, 10, 15, 16, 20, 30, 32, 40, 54, 60, 64, 80, 90, 96, 108, 120, 160, 180, 192, 216, 240, 270, 288, 320, 324, 360, 384, 432, 480, 540, 576, 648, 720, 768, 864, 960, 1080, 1152, 1296, 1440, 1536, 1620, 1728, 1920, 1944

Offset: 1

Amarnath Murthy, Jun 29 2004

nonn

Another rearrangement of the natural numbers.

Description: the iterative extension of the sequence is a loop over the steps: (i) Select the smallest integer not yet in the sequence and append it. (ii) Compute a set of all products of two or more distinct factors taken from the current, finite version of the sequence. (iii) Remove members from this set that are already in the sequence. Append the sorted list of the numbers in the set to the sequence. Return to (i). - R. J. Mathar, Feb 21 2009

			a(3) = 3 because all products of {1, 2} are already included. The only new product generated by {1, 2, 3} is 6, then 4 is the first integer which doesn't appear. Then {1, 2, 3, 6, 4} generates 8 (=2*4), 12 (=2*6=3*4), 18 (=3*6), 24 (=6*4=2*3*4), 36 (=2*3*6), 48 (=2*6*4), 72 (=3*6*4) and 144 (=2*3*6*4). Then the next term is 5. And so on.

R. J. Mathar, Table of n, a(n) for n = 1..385

Cf. A096111, A052330.

L[1]={1} L[n_]:=L[n]=Join[L[n-1], Complement[Union[Exp[Map[ Total,Log[Subsets[Delete[L[n-1],1]]]]]],L[n-1]],{n}] L[6]

Edited by Joel B. Lewis, Nov 15 2006

A368184 Least k such that there are exactly n ways to choose a set consisting of a different binary index of each binary index of k.

Original entry on oeis.org

7, 1, 4, 20, 276, 320, 1088, 65856, 66112, 66624, 263232

Offset: 0

Gus Wiseman, Dec 18 2023

A binary index of n (row n of A048793) is any position of a 1 in its reversed binary expansion. For example, 18 has reversed binary expansion (0,1,0,0,1) and binary indices {2,5}.

			The terms together with the corresponding set-systems begin:
      7: {{1},{2},{1,2}}
      1: {{1}}
      4: {{1,2}}
     20: {{1,2},{1,3}}
    276: {{1,2},{1,3},{1,4}}
    320: {{1,2,3},{1,4}}
   1088: {{1,2,3},{1,2,4}}
  65856: {{1,2,3},{1,4},{1,5}}
  66112: {{1,2,3},{2,4},{1,5}}
  66624: {{1,2,3},{1,2,4},{1,5}}

For strict sequences: A367910, firsts of A367905, sorted A367911.
For multisets w/o distinctness: A367913, firsts of A367912, sorted A367915.
For sequences w/o distinctness: A368111, firsts of A368109, sorted A368112.
Positions of first appearances in A368183.
The sorted version is A368185.
A048793 lists binary indices, length A000120, sum A029931.
A058891 counts set-systems, covering A003465, connected A323818.
A070939 gives length of binary expansion.
A096111 gives product of binary indices.
Cf. A072639, A253317, A326031, A326702, A326753, A355739, A355741, A367771, A367906, A367907.

nn=10000;
bpe[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
q=Table[Length[Union[Sort/@Select[Tuples[bpe/@bpe[n]], UnsameQ@@#&]]],{n,nn}];
k=Max@@Select[Range[Max@@q], SubsetQ[q,Range[#]]&]
Table[Position[q,n][[1,1]],{n,0,k}]

A372439 Numbers k such that the least binary index of k plus the least prime index of k is odd.

Original entry on oeis.org

2, 3, 6, 7, 8, 9, 10, 13, 14, 15, 18, 19, 21, 22, 24, 26, 27, 29, 30, 32, 33, 34, 37, 38, 39, 40, 42, 43, 45, 46, 49, 50, 51, 53, 54, 56, 57, 58, 61, 62, 63, 66, 69, 70, 71, 72, 74, 75, 77, 78, 79, 81, 82, 86, 87, 88, 89, 90, 91, 93, 94, 96, 98, 99, 101, 102

Offset: 1

Gus Wiseman, May 06 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 terms (center), their binary indices (left), and their prime indices (right) begin:
        {2}   2  (1)
      {1,2}   3  (2)
      {2,3}   6  (2,1)
    {1,2,3}   7  (4)
        {4}   8  (1,1,1)
      {1,4}   9  (2,2)
      {2,4}  10  (3,1)
    {1,3,4}  13  (6)
    {2,3,4}  14  (4,1)
  {1,2,3,4}  15  (3,2)
      {2,5}  18  (2,2,1)
    {1,2,5}  19  (8)
    {1,3,5}  21  (4,2)
    {2,3,5}  22  (5,1)
      {4,5}  24  (2,1,1,1)
    {2,4,5}  26  (6,1)
  {1,2,4,5}  27  (2,2,2)
  {1,3,4,5}  29  (10)
  {2,3,4,5}  30  (3,2,1)
        {6}  32  (1,1,1,1,1)
      {1,6}  33  (5,2)
      {2,6}  34  (7,1)

Positions of odd terms in A372437.
The complement is 1 followed by A372440.
For sum (A372428, zeros A372427) we have A372586, complement A372587.
For maximum (A372442, zeros A372436) we have A372588, complement A372589.
For length (A372441, zeros A071814) we have A372590, complement A372591.
A003963 gives product of prime indices, binary A096111.
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, A061712, A174090, A243055, A359495, A372429, A372430, A372431, A372432, A372438, A372471.

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],OddQ[Min[bix[#]]+Min[prix[#]]]&]

A372440 Numbers k such that the least binary index of k plus the least prime index of k is even.

Original entry on oeis.org

4, 5, 11, 12, 16, 17, 20, 23, 25, 28, 31, 35, 36, 41, 44, 47, 48, 52, 55, 59, 60, 64, 65, 67, 68, 73, 76, 80, 83, 84, 85, 92, 95, 97, 100, 103, 108, 109, 112, 115, 116, 121, 124, 125, 127, 132, 137, 140, 143, 144, 145, 148, 149, 155, 156, 157, 164, 167, 172

Offset: 1

Gus Wiseman, May 06 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 terms (center), their binary indices (left), and their prime indices (right) begin:
          {3}   4  (1,1)
        {1,3}   5  (3)
      {1,2,4}  11  (5)
        {3,4}  12  (2,1,1)
          {5}  16  (1,1,1,1)
        {1,5}  17  (7)
        {3,5}  20  (3,1,1)
    {1,2,3,5}  23  (9)
      {1,4,5}  25  (3,3)
      {3,4,5}  28  (4,1,1)
  {1,2,3,4,5}  31  (11)
      {1,2,6}  35  (4,3)
        {3,6}  36  (2,2,1,1)
      {1,4,6}  41  (13)
      {3,4,6}  44  (5,1,1)
  {1,2,3,4,6}  47  (15)
        {5,6}  48  (2,1,1,1,1)
      {3,5,6}  52  (6,1,1)
  {1,2,3,5,6}  55  (5,3)
  {1,2,4,5,6}  59  (17)
    {3,4,5,6}  60  (3,2,1,1)
          {7}  64  (1,1,1,1,1,1)

For sum (A372428, zeros A372427) we have A372587, complement A372586.
Positions of even terms in A372437.
The complement is 1 followed by A372439.
For length (A372441, zeros A071814) we have A372591, complement A372590.
For maximum (A372442, zeros A372436) we have A372589, complement A372588.
A003963 gives product of prime indices, binary A096111.
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, A061712, A174090, A243055, A359402, A359495, A372429, A372430, A372431, A372432, A372438, A372471.

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],EvenQ[Min[bix[#]]+Min[prix[#]]]&]

A372687 Number of prime numbers whose binary indices sum to n. Number of strict integer partitions y of n such that Sum_i 2^(y_i-1) is prime.

Original entry on oeis.org

0, 0, 1, 1, 1, 0, 2, 1, 2, 0, 3, 3, 1, 4, 1, 6, 5, 8, 4, 12, 8, 12, 7, 20, 8, 16, 17, 27, 19, 38, 19, 46, 33, 38, 49, 65, 47, 67, 83, 92, 94, 113, 103, 130, 146, 127, 215, 224, 176, 234, 306, 270, 357, 383, 339, 393, 537, 540, 597, 683, 576, 798, 1026, 830, 1157

Offset: 0

Gus Wiseman, May 15 2024

nonn

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.

Note the inverse of A048793 (binary indices) takes a set s to Sum_i 2^(s_i-1).

			The a(2) = 1 through a(17) = 8 prime numbers:
  2  3  5  .  17  11  19  .  257  131  73  137  97  521  4099  1031
              7       13     67   41       71       263  2053  523
                             37   23       43       139  1033  269
                                           29       83   193   163
                                                    53   47    149
                                                    31         101
                                                               89
                                                               79
The a(2) = 1 through a(11) = 3 strict partitions:
  (2)  (2,1)  (3,1)  .  (5,1)    (4,2,1)  (4,3,1)  .  (9,1)    (6,4,1)
                        (3,2,1)           (5,2,1)     (6,3,1)  (8,2,1)
                                                      (7,2,1)  (5,3,2,1)

For all positive integers (not just prime) we get A000009.
Number of prime numbers p with A029931(p) = n.
For odd instead of prime we have A096765, even A025147, non-strict A087787
Number of times n appears in A372429.
Number of rows of A372471 with sum n.
The non-strict version is A372688 (or A372887), ranks A277319 (or A372850).
These (strict) partitions have Heinz numbers A372851.
A014499 lists binary indices of prime numbers.
A019565 gives Heinz number of binary indices, adjoint A048675.
A038499 counts partitions of prime length, strict A085756.
A048793 lists binary indices:
- length A000120
- min A001511
- sum A029931
- max A070939
- reverse A272020
A058698 counts partitions of prime numbers, strict A064688.
A096111 gives product of binary indices.
A372689 lists numbers whose binary indices sum to a prime.
A372885 lists primes whose binary indices sum to a prime, indices A372886.
Cf. A000040, A005940, A023506, A029837, A035100, A071814, A230877, A231204, A359359, A372436, A372441.

Table[Length[Select[IntegerPartitions[n], UnsameQ@@#&&PrimeQ[Total[2^#]/2]&]],{n,0,30}]

A372850 Numbers whose distinct prime indices are the binary indices of some prime number.

Original entry on oeis.org

3, 6, 9, 10, 12, 18, 20, 22, 24, 27, 30, 36, 40, 42, 44, 46, 48, 50, 54, 60, 66, 70, 72, 80, 81, 84, 88, 90, 92, 96, 100, 102, 108, 114, 118, 120, 126, 130, 132, 140, 144, 150, 160, 162, 168, 176, 180, 182, 184, 192, 198, 200, 204, 216, 228, 236, 238, 240, 242

Offset: 1

Gus Wiseman, May 16 2024

nonn

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.
Note the function taking a set s to its rank Sum_i 2^(s_i-1) is the inverse of A048793 (binary indices).

			The distinct prime indices of 45 are {2,3}, which are the binary indices of 6, which is not prime, so 45 is not in the sequence.
The distinct prime indices of 60 are {1,2,3}, which are the binary indices of 7, which is prime, so 60 is in the sequence.
The terms together with their prime indices begin:
    3: {2}
    6: {1,2}
    9: {2,2}
   10: {1,3}
   12: {1,1,2}
   18: {1,2,2}
   20: {1,1,3}
   22: {1,5}
   24: {1,1,1,2}
   27: {2,2,2}
   30: {1,2,3}
   36: {1,1,2,2}
   40: {1,1,1,3}
   42: {1,2,4}
   44: {1,1,5}
   46: {1,9}
   48: {1,1,1,1,2}
   50: {1,3,3}
   54: {1,2,2,2}
   60: {1,1,2,3}
   66: {1,2,5}
   70: {1,3,4}

For even instead of prime we have A005408, with multiplicity A003159.
For odd instead of prime we have  A005843, with multiplicity A036554.
For prime indices with multiplicity we have A277319, counted by A372688.
The squarefree case is A372851, counted by A372687.
Partitions of this type are counted by A372887.
A014499 lists binary indices of prime numbers.
A019565 gives Heinz number of binary indices, adjoint A048675.
A038499 counts partitions of prime length, strict A085756.
A048793 and A272020 (reverse) list binary indices:
- length A000120
- min A001511
- sum A029931
- max A070939
A058698 counts partitions of prime numbers, strict A064688.
A372885 lists primes whose binary indices sum to a prime, indices A372886.
Cf. A000040, A005940, A023506, A029837, A035100, A071814, A096111, A372429, A372436, A372441, A372471, A372689.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[100],PrimeQ[Total[2^(Union[prix[#]]-1)]]&]

Numbers k such that Sum_{i:prime(i)|k} 2^(i-1) is prime, where the sum is over the distinct prime indices of k.

A372851 Squarefree numbers whose prime indices are the binary indices of some prime number.

Original entry on oeis.org

3, 6, 10, 22, 30, 42, 46, 66, 70, 102, 114, 118, 130, 182, 238, 246, 266, 318, 330, 354, 370, 402, 406, 434, 442, 510, 546, 646, 654, 690, 762, 770, 798, 930, 938, 946, 962, 986, 1066, 1102, 1122, 1178, 1218, 1222, 1246, 1258, 1334, 1378, 1430, 1482, 1578

Offset: 1

Gus Wiseman, May 16 2024

nonn

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.
Note the function taking a set s to its rank Sum_i 2^(s_i-1) is the inverse of A048793 (binary indices).

			The prime indices of 70 are {1,3,4}, which are the binary indices of 13, which is prime, so 70 is in the sequence.
The prime indices of 15 are {2,3}, which are the binary indices of 6, which is not prime, so 15 is not in the sequence.
The terms together with their prime indices begin:
    3: {2}
    6: {1,2}
   10: {1,3}
   22: {1,5}
   30: {1,2,3}
   42: {1,2,4}
   46: {1,9}
   66: {1,2,5}
   70: {1,3,4}
  102: {1,2,7}
  114: {1,2,8}
  118: {1,17}
  130: {1,3,6}
  182: {1,4,6}
  238: {1,4,7}
  246: {1,2,13}
  266: {1,4,8}
  318: {1,2,16}
  330: {1,2,3,5}
  354: {1,2,17}
  370: {1,3,12}
  402: {1,2,19}

[Warning: do not confuse A372887 with the strict case A372687.]
For odd instead of prime we have A039956.
For even instead of prime we have A056911.
Strict partitions of this type are counted by A372687.
Non-strict partitions of this type are counted by A372688, ranks A277319.
The nonsquarefree version is A372850, counted by A372887.
A014499 lists binary indices of prime numbers.
A019565 gives Heinz number of binary indices, adjoint A048675.
A038499 counts partitions of prime length, strict A085756.
A048793 and A272020 (reverse) list binary indices:
- length A000120
- min A001511
- sum A029931
- max A070939
A058698 counts partitions of prime numbers, strict A064688.
A372885 lists primes whose binary indices sum to a prime, indices A372886.
Cf. A000040, A005940, A025147, A035100, A071814, A096111, A096765, A231204, A372429, A372471, A372689.

Select[Range[100],SquareFreeQ[#] && PrimeQ[Total[2^(PrimePi/@First/@FactorInteger[#]-1)]]&]

Squarefree numbers k such that Sum_{i:prime(i)|k} 2^(i-1) is prime, where the sum is over the (distinct) prime indices of k.

A372888 Sum of binary ranks of all strict integer partitions of n, where the binary rank of a partition y is given by Sum_i 2^(y_i-1).

Original entry on oeis.org

0, 1, 2, 7, 13, 31, 66, 138, 279, 581, 1173, 2375, 4783, 9630, 19316, 38802, 77689, 155673, 311639, 623845, 1248179, 2497719, 4996387, 9995304, 19992908, 39990902, 79986136, 159983241, 319975073, 639971495, 1279962115, 2559966847, 5119970499, 10240030209

Offset: 0

Gus Wiseman, May 23 2024

nonn

			The strict partitions of 6 are (6), (5,1), (4,2), (3,2,1), with respective binary ranks 32, 17, 10, 7 with sum 66, so a(6) = 66.

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

Row sums of A118462 (binary ranks of strict partitions).
For Heinz number the non-strict version is A145519, row sums of A215366.
For Heinz number (not binary rank) we have A147655, row sums of A246867.
The non-strict version is A372890.
A000009 counts strict partitions, ranks A005117.
A048675 gives binary rank of prime indices, distinct A087207.
A277905 groups all positive integers by binary rank of prime indices.
Binary indices (A048793):
- length A000120, complement A023416
- min A001511, opposite A000012
- max A029837 or A070939, opposite A070940
- sum A029931, product A096111
- reverse A272020
- complement A368494, sum A359400
- opposite A371572, sum A230877
- opposite complement A371571, sum A359359
Cf. A000041, A005940, A015716, A018819, A019565, A118457, A225620, A344086.

b:= proc(n, i) option remember; `if`(i*(i+1)/2 [0, p[1]*2^(i-1)]
          +p)(b(n-i, min(n-i, i-1)))))
    end:
a:= n-> b(n$2)[2]:
seq(a(n), n=0..33);  # Alois P. Heinz, May 23 2024

Table[Total[Total[2^(#-1)]& /@ Select[IntegerPartitions[n],UnsameQ@@#&]],{n,0,10}]

a(n) = Sum_{k=1..n} 2^(k-1) * A015716(n,k). - Alois P. Heinz, May 24 2024

cp's OEIS Frontend

A372885 Prime numbers whose binary indices (positions of ones in reversed binary expansion) sum to another prime number.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

A372890 Sum of binary ranks of all integer partitions of n, where the binary rank of a partition y is given by Sum_i 2^(y_i-1).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A096113 a(1) = 1, a(2) = 2; then all new products of subsets of pre-existing terms, then the first integer not present, and so on.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A368184 Least k such that there are exactly n ways to choose a set consisting of a different binary index of each binary index of k.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A372439 Numbers k such that the least binary index of k plus the least prime index of k is odd.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A372440 Numbers k such that the least binary index of k plus the least prime index of k is even.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A372687 Number of prime numbers whose binary indices sum to n. Number of strict integer partitions y of n such that Sum_i 2^(y_i-1) is prime.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A372850 Numbers whose distinct prime indices are the binary indices of some prime number.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula